Maximum number of disjoint paths connecting specified terminals in a graph (Q1339394)

From MaRDI portal
Revision as of 10:45, 23 May 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
Maximum number of disjoint paths connecting specified terminals in a graph
scientific article

    Statements

    title
    Maximum number of disjoint paths connecting specified terminals in a graph (English)
    0 references
    author
    Hananya Yinnone
    0 references
    publication date
    5 July 1995
    0 references
    zbMATH DE Number
    699141
    0 references
    zbMATH Keywords
    matching problem
    0 references
    odd \(T\)-disconnector
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1339394&oldid=34135574"
    Powered by MediaWiki