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

From MaRDI portal
Revision as of 17:11, 4 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Graph connectivity and its augmentation: Applications of MA orderings
scientific article

    Statements

    title
    Graph connectivity and its augmentation: Applications of MA orderings (English)
    0 references
    author
    Hiroshi Nagamochi
    0 references
    Toshihide Ibaraki
    0 references
    publication date
    17 September 2002
    0 references
    zbMATH DE Number
    1801740
    0 references
    zbMATH Keywords
    graphs
    0 references
    MA ordering
    0 references
    minimum cuts
    0 references
    edge-connectivity
    0 references
    graph augmentation
    0 references
    polynomial time algorithms
    0 references
    cites work
    Q3056948
    0 references
    Q5501810
    0 references
    Q4371290
    0 references
    Q4242949
    0 references
    Augmentation Problems
    0 references
    Q4250191
    0 references
    Q5595961
    0 references
    Q2721988
    0 references
    Q4370202
    0 references
    Q4250193
    0 references
    Q4249524
    0 references
    Q4938784
    0 references
    Q4263718
    0 references
    Q4037427
    0 references
    Q4228454
    0 references
    Q4542522
    0 references
    Q3880849
    0 references
    Q3140458
    0 references
    Q3840350
    0 references
    Q4249525
    0 references
    Q4398376
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q697579&oldid=34319269"
    Powered by MediaWiki