Path-width and three-dimensional straight-line grid drawings of graphs

DOI10.1007/3-540-36151-0_5MaRDI QIDQ4422261zbMATH OpenFDO

Authors Vida Dujmović, Pat Morin, David R. Wood

Publication date 3 September 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/2528/25280042.htm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2145229
• Graph Drawing
• Queue layouts, tree-width, and three-dimensional graph drawing
• Layout of Graphs with Bounded Tree-Width
• Computing straight-line 3D grid drawings of graphs in linear volume

Cited in

(10)

• Gridline graphs: A review in two dimensions and an extension to higher dimensions
• Linkless symmetric drawings of series parallel digraphs
• Computing straight-line 3D grid drawings of graphs in linear volume
• Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
• Cubic Planar Graphs that cannot be Drawn on few Lines
• Graph Drawing
• Planar graphs of bounded degree have bounded queue number
• 2-Layer Graph Drawings with Bounded Pathwidth
• Grid drawings of \(k\)-colourable graphs
• 2-connecting outerplanar graphs without blowing up the pathwidth

This page was built for publication: Path-width and three-dimensional straight-line grid drawings of graphs

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