Minimum depth graph embedding

DOI10.1007/3-540-45253-2_33MaRDI QIDQ2753952zbMATH OpenFDO

Authors Maurizio Pizzonia, Roberto Tamassia

Publication date 11 November 2001

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

Full work available at URL https://doi.org/10.1007/3-540-45253-2_33

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Graph Drawing
• scientific article; zbMATH DE number 51713
• Embeddings of graphs
• Graph Drawing
• Tight lower bounds on graph embedding problems
• Minimum difference representations of graphs
• Minimal Euclidean representations of graphs
• Embedding graphs of small size

Cited in

(6)

• Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time
• Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
• Graph Drawing
• Graph Drawing
• Ranking and unranking of the planar embeddings of a planar graph
• Automated rendering of multi-stranded DNA complexes with pseudoknots

This page was built for publication: Minimum depth graph embedding

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