On Linear Layouts of Graphs

On Linear Layouts of Graphs (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Vida Dujmovic , David R. Wood

Citations:

23 - 17 self

BibTeX

@MISC{Dujmovic04onlinear,
    author = {Vida Dujmovic and David R. Wood},
    title = {On Linear Layouts of Graphs},
    year = {2004}
}

Bookmark

OpenURL

Abstract

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 (resp...

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
991	Algorithmic Graph Theory and Perfect Graphs - Golumbic - 1980
697	Fellows M: Parameterized Complexity - Downey - 1999
540	Introduction to Algorithms, Second Edition - Cormen, Leiserson, et al. - 2001
444	A Heuristic for Graph Drawing - Eades - 1984
374	Combinatorial algorithms for integrated circuit layout - Lengauer - 1990
283	Graph Drawing – Algorithms for the Visualization of Graphs - Battista, Eades, et al. - 1999
234	Graph classes: a survey - Brandstadt, Le, et al. - 1999
213	Graph rewriting: An algebraic and logic approach - Courcelle - 1990
211	A partial k-arboretum of graphs with bounded treewidth - Bodlaender - 1998
207	A decomposition theorem for partially ordered sets - Dilworth
187	A combinatorial problem in geometry - Erdős, Szekeres - 1935
186	Crossing number is np-complete - Garey, Johnson - 1983
160	Incidence matrices and interval graphs - Fulkerson, Gross - 1965
141	Vertex cover: Further observations and further improvements - Chen, Kanj, et al.
141	Partially ordered sets - Dushnik, Miller - 1941
138	A linear-time algorithm for finding tree-decompositions of small treewidth - Bodlaender - 1996
136	Space-efficient static trees and graphs - Jacobson - 1989
130	Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Math - Proskurowski, Arnborg - 1989
129	How to draw a planar graph on a grid - Fraysseix, Pach, et al. - 1990
115	On straight line representation of planar graphs - Fary - 1948
104	The complexity of coloring circular arcs and chords - Garey, Johnson, et al. - 1980
79	N.C.: Edge crossings in drawings of bipartite graphs - Eades, Wormald - 1994
73	The book thickness of a graph - Bernhart, Kainen - 1979
73	On the total coloring of planar graphs - Borodin - 1989
71	R.: On the computational complexity of upward and rectilinear planarity testing - Garg, Tamassia - 2001
64	Restricted colorings of graphs - Alon - 1993
63	Parameterized complexity: A framework for systematically confronting computational intractability - Downey, Fellows, et al. - 1999
56	How to draw a planar graph on a grid, Combinatorica 10 - Frajsseix, Pach, et al. - 1990
55	Acyclic colorings of planar graphs - GRÜNBAUM - 1973
53	P.: 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms - Jünger, Mutzel - 1997
44	Leeuwen. The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits - Kramer, van - 1984
42	Automatic display of hierarchized graphs for computeraided decision analysis - Carpano - 1980
40	A.L.: Three-dimensional circuit layouts - Leighton, Rosenberg - 1986
39	Laying out graphs using queues - Heath, Rosenberg - 1992
35	Acyclic and oriented chromatic numbers of graphs - KOSTOCHKA, SOPENA, et al. - 1997
34	Straight-line drawings on restricted integer grids in two and three dimensions - Felsner, Liotta, et al.
33	Embedding graphs in books: a layout problem with applications to VSLI design - Chung, Leighton, et al. - 1987
32	3D graph drawing with simulated annealing - CRUZ, TWAROG
31	Decompositions of finite graphs into forests - Nash-Williams - 1964
29	Comparing queues and stacks as mechanisms for laying out graphs - Heath, Leighton, et al. - 1992
29	Compact routing tables for graphs of bounded genus - GAVOILLE, HANUSSE - 1999
28	Convex drawings of graphs in two and three dimensions - Chrobak, Goodrich, et al. - 1996
28	S.: Drawing graphs in two layers - Eades, Whitesides - 1994
27	On the maximum average degree and the oriented chromatic number of a graph, Discrete Math. 206 - Borodin, Kostochka, et al. - 1999
27	Geometric thickness of complete graphs - Dillencourt, Eppstein, et al.
27	N.: On an edge crossing problem - Eades, McKay, et al. - 1986
26	Embedding planar graphs in four pages - Yannakakis
26	Fast interactive 3-D graph visualization - BRUss, FRICK - 1997
25	Problems from the world surrounding perfect graphs. Zastos - GY'ARF'AS - 1987