Results 1 to 10 of about 21,630 (299)
Discrete Mathematics & Theoretical Computer Science, 2004 A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +9 more sources
Queue Layouts of Graph Products and Powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A k-queue layout of a graph G consists of a linear order σ of V(G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ.
David R. Wood
doaj +7 more sources
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-stack layout (respectively, \emphk-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +6 more sources
On Linear Layouts of Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A k-stack (respectively, k-queue, k-arch) layout of a graph consists of a total order of the vertices, and a partition of the
Vida Dujmović, David R. Wood
doaj +5 more sources
Constrained graph layout [PDF]
, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weiqing He, Kim Marriott
openalex +5 more sources
Linear Layouts of Complete Graphs [PDF]
, 2021 Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
Stefan Felsner +3 more
openalex +5 more sources
Chicago Journal of Theoretical Computer Science, 2015 Bourgain and Yehudayoff recently constructed $O(1)$-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple ...
Vida Dujmović +2 more
openalex +5 more sources
Approximating layout problems on random graphs
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Josep Dı́az +3 more
openalex +3 more sources
Portable graph layout and editing [PDF]
, 1996 The Graph Layout Toolkit and the Graph Layout Toolkit are portable, flexible toolkits for graph layout and graph editing systems. The Graph Layout Toolkit contains four highly customizable layout algorithms, and supports hierarchical graphs. The Graph Editor Toolkit is a tightly coupled interactive front end to the Graph Layout Toolkit.
Brendan Madden +3 more
openalex +3 more sources
Graph Layouts via Layered Separators
Journal of Combinatorial Theory, Series B, 2013 A k-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets such that no two edges that are in the same set are nested with respect to the vertex ordering. A k-track layout of a graph consists of a vertex k-colouring, and a total order of each vertex colour class, such that between each pair of colour
Vida Dujmović
openalex +5 more sources