Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time
From MaRDI portal
Publication:3603534
DOI10.1007/978-3-540-73951-7_26zbMath1209.05235OpenAlexW60726899MaRDI QIDQ3603534
Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani
Publication date: 17 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_26
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)