Bitonic st-orderings for Upward Planar Graphs

DOI10.1007/978-3-319-50106-2_18zbMath1478.68241arXiv1608.08578OpenAlexW2517713975MaRDI QIDQ2961518

Martin Gronemann

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.08578

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario ⋮ Planar Confluent Orthogonal Drawings of 4-Modal Digraphs ⋮ Planar confluent orthogonal drawings of 4-modal digraphs ⋮ Bitonic st-orderings for Upward Planar Graphs ⋮ Unnamed Item ⋮ Planar L-Drawings of Directed Graphs ⋮ Universal slope sets for upward planar drawings ⋮ Universal slope sets for upward planar drawings

Cites Work

• Unnamed Item
• How to draw a planar graph on a grid
• Upward drawings of triconnected digraphs.
• Improving the running time of embedded upward planarity testing
• Algorithms for plane representations of acyclic digraphs
• Area requirement and symmetry display of planar upward drawings
• An algorithm for straight-line drawing of planar graphs
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Bipolar orientations revisited
• Drawing planar graphs using the canonical ordering
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
• Bitonic st-orderings of Biconnected Planar Graphs
• Bitonic st-orderings for Upward Planar Graphs
• Upward Spirality and Upward Planarity Testing
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• The Mondshein Sequence
• The (3,1)-ordering for 4-connected planar triangulations

This page was built for publication: Bitonic st-orderings for Upward Planar Graphs