More Canonical Ordering

DOI10.7155/jgaa.00219zbMath1217.05066OpenAlexW2133341828MaRDI QIDQ3168834

Sabine Cornelsen, Melanie Badent, Ulrik Brandes

Publication date: 19 April 2011

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222806

zbMATH Keywords

linear-time algorithmplanar graph drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Contact Representations of Graphs in 3D ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Edge-orders ⋮ Drawing graphs as spanners ⋮ Mondshein Sequences (a.k.a. (2,1)-Orders)

This page was built for publication: More Canonical Ordering