Triangulating planar graphs while minimizing the maximum degree (Q1363779): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hans L. Bodlaender / rank
Normal rank
 
Property / author
 
Property / author: Hans L. Bodlaender / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/inco.1997.2635 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115560940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triangulating planar graphs under the four-connectivity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for drawing graphs: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Angles of planar triangular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One strike against the min-max degree triangulation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar graphs using the canonical ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Angular Resolution of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle packings of maps in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Optimally Increasing the Edge Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest Augmentations to Biconnect a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity augmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum 3-connectivity augmentation of a graph / rank
 
Normal rank

Revision as of 17:12, 27 May 2024

scientific article
Language Label Description Also known as
English
Triangulating planar graphs while minimizing the maximum degree
scientific article

    Statements

    Triangulating planar graphs while minimizing the maximum degree (English)
    0 references
    0 references
    0 references
    11 August 1997
    0 references
    planar graph
    0 references
    triangulation algorithm
    0 references

    Identifiers