The minimum augmentation of any graph to aK-edge-connected graph (Q3825104)

From MaRDI portal
Revision as of 20:04, 21 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The minimum augmentation of any graph to aK-edge-connected graph
scientific article

    Statements

    title
    The minimum augmentation of any graph to aK-edge-connected graph (English)
    0 references
    author
    Guoray Cai
    0 references
    Yugeng Sun
    0 references
    published in
    Networks
    0 references
    publication date
    1989
    0 references
    zbMATH Keywords
    adding edges
    0 references
    arbitrary multigraph
    0 references
    polynomial algorithm
    0 references
    k-edge- connected graph
    0 references
    polynomial augmentation algorithm
    0 references

    Identifiers

    zbMATH DE Number
    4099356
    0 references
    OpenAlex ID
    W2102671623
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3825104&oldid=39349701"
    Powered by MediaWiki