Bitonic st-orderings of Biconnected Planar Graphs

DOI10.1007/978-3-662-45803-7_14zbMath1426.68213OpenAlexW104000684MaRDI QIDQ2936923

Martin Gronemann

Publication date: 7 January 2015

Published in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45803-7_14

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Universal slope sets for 1-bend planar drawings ⋮ Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario ⋮ Bitonic st-orderings for Upward Planar Graphs ⋮ Unnamed Item ⋮ Planar L-Drawings of Directed Graphs ⋮ Universal slope sets for upward planar drawings

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