Triangulating planar graphs while minimizing the maximum degree
From MaRDI portal
Publication:1363779
DOI10.1006/INCO.1997.2635zbMATH Open0879.68082OpenAlexW2115560940MaRDI QIDQ1363779FDOQ1363779
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
Recommendations
Cites Work
- Some simplified NP-complete graph problems
- How to draw a planar graph on a grid
- Algorithms for drawing graphs: An annotated bibliography
- On triangulating planar graphs under the four-connectivity constraint
- Title not available (Why is that?)
- Drawing planar graphs using the canonical ordering
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- A Fast Algorithm for Optimally Increasing the Edge Connectivity
- Augmentation Problems
- Edge-connectivity augmentation problems
- On the Angular Resolution of Planar Graphs
- Title not available (Why is that?)
- Augmenting Outerplanar Graphs
- Smallest Augmentations to Biconnect a Graph
- A minimum 3-connectivity augmentation of a graph
- Title not available (Why is that?)
- One strike against the min-max degree triangulation problem
- Circle packings of maps in polynomial time
- Angles of planar triangular graphs
Cited In (22)
- Universal slope sets for 1-bend planar drawings
- The Stub Resolution of 1-planar Graphs
- Embedding-preserving rectangle visibility representations of nonplanar graphs
- Title not available (Why is that?)
- One strike against the min-max degree triangulation problem
- A force-directed algorithm that preserves edge-crossing properties
- Title not available (Why is that?)
- Triangulating planar graphs while minimizing the maximum degree
- A new algorithm for embedding plane graphs at fixed vertex locations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ortho-polygon visibility representations of embedded graphs
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- Higher order Delaunay triangulations
- On triangulating planar graphs under the four-connectivity constraint
- Title not available (Why is that?)
- Optimization for first order Delaunay triangulations
- On triangulating \(k\)-outerplanar graphs
- Triangulating Planar Graphs While Keeping the Pathwidth Small
- Counting polygon triangulations is hard
- Dual circumference and collinear sets
- On partitioning the edges of 1-plane graphs
This page was built for publication: Triangulating planar graphs while minimizing the maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363779)
