Triangulating planar graphs while minimizing the maximum degree
From MaRDI portal
Publication:1363779
DOI10.1006/inco.1997.2635zbMath0879.68082MaRDI QIDQ1363779
Publication date: 11 August 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1997.2635
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- One strike against the min-max degree triangulation problem
- How to draw a planar graph on a grid
- Edge-connectivity augmentation problems
- A minimum 3-connectivity augmentation of a graph
- Some simplified NP-complete graph problems
- Algorithms for drawing graphs: An annotated bibliography
- Circle packings of maps in polynomial time
- Drawing planar graphs using the canonical ordering
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmentation Problems
- Smallest Augmentations to Biconnect a Graph
- On the Angular Resolution of Planar Graphs
- A Fast Algorithm for Optimally Increasing the Edge Connectivity
- Augmenting Outerplanar Graphs
- On triangulating planar graphs under the four-connectivity constraint
- Angles of planar triangular graphs