1-Bend Upward Planar Drawings of SP-Digraphs

DOI10.1007/978-3-319-50106-2_10zbMath1478.68230arXiv1608.08425OpenAlexW2512956550MaRDI QIDQ2961509

Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani

Publication date: 21 February 2017

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

Full work available at URL: https://arxiv.org/abs/1608.08425

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Universal slope sets for 1-bend planar drawings ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ Universal slope sets for upward planar drawings

Cites Work

• Unnamed Item
• The planar slope number of planar partial 3-trees of bounded degree
• Drawing orders with few slopes
• Maximum upward planar subgraphs of embedded planar digraphs
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• A better heuristic for orthogonal graph drawings
• Outerplanar graph drawings with few slopes
• Lattice diagrams with few slopes
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Graph Drawings with One Bend and Few Slopes
• Planar and Plane Slope Number of Partial 2-Trees
• Upward Spirality and Upward Planarity Testing
• Optimal Upward Planarity Testing of Single-Source Digraphs
• Graph Drawing
• Upward Planar Drawings and Switch-regularity Heuristics
• The Planar Slope Number of Subcubic Graphs
• Drawing Planar Graphs of Bounded Degree with Few Slopes
• Drawing Outer 1-planar Graphs with Few Slopes

This page was built for publication: 1-Bend Upward Planar Drawings of SP-Digraphs