Connectivity augmentation in planar straight line graphs (Q661949): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Augmenting the connectivity of geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting the edge connectivity of planar straight line graphs to three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250191 / 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: Augmenting the connectivity of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness and Approximability of Planar Biconnectivity Augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Biconnectivity Augmentation with Fixed Embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar minimally rigid graphs and pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence free graphs and vertex connectivity augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Method for Edge-Connectivity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An edge-splitting algorithm in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph connectivity and its augmentation: Applications of MA orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing even crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum block containing a given graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Simple Circuits from a Set of Line Segments is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting the Connectivity of Planar and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Perimeter Polygons of Digitized Silhouettes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting undirected node-connectivity by one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zum Vierfarbenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity augmentation problems / rank
 
Normal rank

Latest revision as of 22:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Connectivity augmentation in planar straight line graphs
scientific article

    Statements

    Connectivity augmentation in planar straight line graphs (English)
    0 references
    0 references
    11 February 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    connected planar straight line graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references