An algorithm to increase the node-connectivity of a digraph by one (Q955325)

From MaRDI portal
Revision as of 06:38, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/disopt/FrankV08, #quickstatements; #temporary_batch_1731475607626)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithm to increase the node-connectivity of a digraph by one
scientific article

    Statements

    title
    An algorithm to increase the node-connectivity of a digraph by one (English)
    0 references
    author
    András Frank
    0 references
    László A. Végh
    0 references
    publication date
    19 November 2008
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    connectivity augmentation
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C40
    0 references
    05C20
    0 references
    zbMATH DE Number
    5369030
    0 references
    Wikidata QID
    Q56987172
    0 references
    OpenAlex ID
    W2106199941
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q955325&oldid=37898420"
    Powered by MediaWiki