Results 21 to 30 of about 2,196,757 (262)
A note on domino treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 In [DO95], Ding and Oporowski proved that for every k, and d, there exists a constant c_k,d, such that every graph with treewidth at most k and maximum degree at most d has domino treewidth at most c_k,d.
Hans L. Bodlaender
doaj +1 more source
Order Reconfiguration under Width Constraints [PDF]
, 2023 In this work, we consider the following order reconfiguration problem: Given a graph G together with linear orders ω and ω′ of the vertices of G, can one transform ω into ω′ by a sequence of swaps of adjacent elements in such a way that, at each time ...
Petra Wolf +10 more
core +1 more source
Graph Algorithm Animation with Grrr [PDF]
, 2000 We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers +3 more
core +1 more source
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Exploring Graph Traversal Algorithms in Graph-Based Molecular Generation [PDF]
, 2021 Here, we explore the impact of different graph traversal algorithms on molecular graph generation. We do this by training a graph-based deep molecular generative model to build structures using a node order determined via either a breadth- or depth-first
Engkvist, Ola +8 more
core +1 more source
GRAph Parallel Actor Language: A Programming Language for Parallel Graph Algorithms [PDF]
, 2013 We introduce a domain-specific language, GRAph Parallel Actor Language, that enables parallel graph algorithms to be written in a natural, high-level form.
DeLorimier, Michael John
core +1 more source
A survey of two-dimensional graph layout techniques for information visualisation [PDF]
, 2012 Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core +1 more source
Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring [PDF]
, 1997 We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints.
Magnús M. Halldórsson +3 more
core +1 more source
Evaluating the Effects of the Clique Selection in Exact Graph Coloring Algorithms
, 2011 It is a common practice in exact enumerative algorithms for graph colouring to find a clique of maximum cardinality and to fix the colours of this subgraph before proceeding with implicit enumeration on the remainder of the graph.
International Journal O. F. Operational Research +4 more
core +1 more source
An Experimental Evaluation of Graph Coloring Heuristics on Multi- and Many-Core Architectures
IEEE Access, 2023 Many modern applications are modeled using graphs of some kind. Given a graph, assigning labels (usually called colors) to vertices is called graph coloring. Colors must be assigned so that no two vertices connected by an edge share the same color. Graph
Alessandro Borione +3 more
doaj +1 more source