Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario

DOI10.1007/s00453-023-01111-5MaRDI QIDQ6053469

Michael A. Bekos, Patrizio Angelini, Martin Gronemann, Henry Förster

Publication date: 27 September 2023

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

upward planar graphsbend minimizationplanar polyline drawingsbitonic \(st\)-orderings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• How to draw a planar graph on a grid
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Algorithms for plane representations of acyclic digraphs
• Area requirement and symmetry display of planar upward drawings
• Computing an st-numbering
• A better heuristic for orthogonal graph drawings
• An algorithm for straight-line drawing of planar graphs
• On-line maintenance of triconnected components with SPQR-trees
• Drawing planar graphs using the canonical ordering
• Universal slope sets for 1-bend planar drawings
• Bitonic st-orderings of Biconnected Planar Graphs
• Bitonic st-orderings for Upward Planar Graphs
• ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
• Computing orthogonal drawings with the minimum number of bends
• Planar L-Drawings of Directed Graphs
• On-Line Planarity Testing
• Universal slope sets for upward planar drawings

This page was built for publication: Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario