Graph Drawing
From MaRDI portal
Publication:5896899
DOI10.1007/B94919zbMATH Open1215.05042OpenAlexW4250021921MaRDI QIDQ5896899FDOQ5896899
Authors: Carsten Gutwenger, Petra Mutzel 
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94919
Recommendations
- scientific article; zbMATH DE number 1670673
- On the complexity of graph embeddings
- Uniqueness and minimality of large face-width embeddings of graphs
- Tight lower bounds on graph embedding problems
- Algorithmic graph embeddings
- Face-width of embedded graphs
- Face distributions of embeddings of complete graphs
- scientific article; zbMATH DE number 4156462
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (9)
- Title not available (Why is that?)
- Graph Drawing
- Title not available (Why is that?)
- HV-planarity: algorithms and complexity
- Star-struck by fixed embeddings: modern crossing number heuristics
- Planar embeddings with small and uniform faces
- On the complexity of embedding planar graphs to minimize certain distance measures
- 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
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 Q5896899)
