Graph Drawing

DOI10.1007/11618058zbMATH Open1171.68642OpenAlexW4251892597MaRDI QIDQ5897648FDOQ5897648

Authors: Maurizio Pizzonia 

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11618058

Recommendations

• scientific article; zbMATH DE number 1670673
• Graph Drawing
• Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
• Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time
• scientific article; zbMATH DE number 219263

Mathematics Subject Classification ID

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

Cited In (2)

• Title not available (Why is that?)
• Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time

This page was built for publication: Graph Drawing

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