Universal slope sets for upward planar drawings

DOI10.1007/s00453-022-00975-3OpenAlexW2794725362MaRDI QIDQ5918782

Walter Didimo, Emilio Di Giacomo, Michael A. Bekos, Fabrizio Montecchiani, Giuseppe Liotta

Publication date: 18 August 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-00975-3

zbMATH Keywords

upward planarityslope numberplanar \textit{st}-graphsuniversal slope sets

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The planar slope number of planar partial 3-trees of bounded degree
• On \(d\)-regular schematization of embedded paths
• A linear-time algorithm for drawing a planar graph on a grid
• How to draw a planar graph on a grid
• Drawing orders with few slopes
• Planar drawings with few slopes of Halin graphs and nested pseudotrees
• Fundamentals of planar ordered sets
• Algorithms for plane representations of acyclic digraphs
• A better heuristic for orthogonal graph drawings
• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• Upward planar drawings with three and more slopes
• 1-bend upward planar slope number of SP-digraphs
• Graph drawings with few slopes
• Drawings of planar graphs with few slopes and segments
• Universal slope sets for 1-bend planar 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
• Upward Planarity Testing in Practice
• On Balanced -Contact Representations
• Planar and Plane Slope Number of Partial 2-Trees
• Bitonic st-orderings of Biconnected Planar Graphs
• Bitonic st-orderings for Upward Planar Graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Universality considerations in VLSI circuits
• Optimal Upward Planarity Testing of Single-Source Digraphs
• Planar L-Drawings of Directed Graphs
• A Note on Rectilinearity and Angular Resolution
• Upward planar drawings with two slopes
• On the Total Number of Bends for Planar Octilinear Drawings
• The Two-Triangle Case of the Acquaintance Graph
• Drawing Planar Graphs of Bounded Degree with Few Slopes
• Planar Octilinear Drawings with One Bend Per Edge
• Drawing Outer 1-planar Graphs with Few Slopes

This page was built for publication: Universal slope sets for upward planar drawings