Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time

DOI10.1007/978-3-540-73951-7_26zbMATH Open1209.05235OpenAlexW60726899MaRDI QIDQ3603534FDOQ3603534

Authors: 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

Recommendations

• Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
• Publication:2753952
• Graph Drawing
• On the complexity of embedding planar graphs to minimize certain distance measures
• On embedding an outer-planar graph in a point set

zbMATH Keywords

algorithmminimum distancegraph embedding

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (4)

• Graph Drawing
• On the complexity of embedding planar graphs to minimize certain distance measures
• Determining the Smallest k Such That G Is k-Outerplanar
• Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time

This page was built for publication: Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603534)