Graph connectivity and its augmentation: Applications of MA orderings (Q697579)

From MaRDI portal
Revision as of 17:23, 7 July 2025 by CorrectionBot (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 1801740
Language Label Description Also known as
English
Graph connectivity and its augmentation: Applications of MA orderings
scientific article; zbMATH DE number 1801740

    Statements

    Graph connectivity and its augmentation: Applications of MA orderings (English)
    0 references
    0 references
    0 references
    17 September 2002
    0 references
    graphs
    0 references
    MA ordering
    0 references
    minimum cuts
    0 references
    edge-connectivity
    0 references
    graph augmentation
    0 references
    polynomial time algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers