Comparing Queues and Stacks As Machines for Laying Out Graphs
From MaRDI portal
Publication:4018851
DOI10.1137/0405031zbMath0764.05093WikidataQ61067912 ScholiaQ61067912MaRDI QIDQ4018851
Lenwood S. Heath, Arnold L. Rosenberg, Frank Thompson Leighton
Publication date: 16 January 1993
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0405031
book embedding; graph embedding; linear order; queue layout; stack layout; queuenumber; stacknumber; ternary hypercube
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C99: Graph theory
94C15: Applications of graph theory to circuits and networks
Related Items
Data Structures and their Planar Graph Layouts, (3,2)-Track Layout of Bipartite Graph Subdivisions, Graph layouts via layered separators, On the queue-number of graphs with bounded tree-width, Characterisations and examples of graph classes with bounded expansion, Acyclically 3-colorable planar graphs, Curve-constrained drawings of planar graphs, Queue layouts of iterated line directed graphs, RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties, A new upper bound on the queuenumber of hypercubes, Upper bounds on the queue number of \(k\)-ary \(n\)-cubes, Processor-efficient sparse matrix-vector multiplication, Computing straight-line 3D grid drawings of graphs in linear volume, Layered separators in minor-closed graph classes with applications, Upward three-dimensional grid drawings of graphs, Unnamed Item, Topological Graph Layouts into a Triangular Prism, Characterizations of Deque and Queue Graphs, On the Page Number of Upward Planar Directed Acyclic Graphs, Layouts of Expander Graphs
