A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION (Q2841986): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest Augmentations to Biconnect a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler and faster biconnectivity augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Four-Connecting a Triconnected Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity augmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique tree generalization and new subclasses of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique-separator graph for chordal graphs / rank
 
Normal rank

Revision as of 16:18, 6 July 2024

scientific article
Language Label Description Also known as
English
A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION
scientific article

    Statements

    A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION (English)
    0 references
    0 references
    0 references
    30 July 2013
    0 references
    biconnectivity augmentation
    0 references
    triconnectivity augmentation
    0 references
    chordal augmentation
    0 references

    Identifiers