Queue layouts, tree-width, and three-dimensional graph drawing

DOI10.1007/3-540-36206-1_31MaRDI QIDQ4415269zbMATH OpenFDO

Authors David R. Wood

Publication date 28 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2556/25560348.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Layout of Graphs with Bounded Tree-Width
• Tree-partitions of k-trees with applications in graph layout.
• Planar graphs of bounded degree have bounded queue number
• Planar graphs of bounded degree have bounded queue number
• On the Queue Number of Planar Graphs

Cited in

(22)

• On the queue number of planar graphs
• Computing straight-line 3D grid drawings of graphs in linear volume
• An improved upper bound on the queue number of planar graphs
• Plane Drawings of Queue and Deque Graphs
• Characterizations of deque and queue graphs
• Laying Out Graphs Using Queues
• Path-width and three-dimensional straight-line grid drawings of graphs
• Data Structures and their Planar Graph Layouts
• The Local Queue Number of Graphs with Bounded Treewidth
• Graph Drawing
• Graph Drawing
• Planar graphs of bounded degree have bounded queue number
• On the queue-number of graphs with bounded tree-width
• Planar graphs of bounded degree have bounded queue number
• Layout of Graphs with Bounded Tree-Width
• Tree-partitions of k-trees with applications in graph layout.
• Queue layouts of planar 3-trees
• Queue layouts of planar 3-trees
• Curve-constrained drawings of planar graphs
• Queue layouts of iterated line directed graphs
• A new upper bound on the queuenumber of hypercubes
• Upper bounds on the queue number of \(k\)-ary \(n\)-cubes

This page was built for publication: Queue layouts, tree-width, and three-dimensional graph drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415269)