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

From MaRDI portal
Revision as of 04:00, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Maximum number of disjoint paths connecting specified terminals in a graph
scientific article

    Statements

    Maximum number of disjoint paths connecting specified terminals in a graph (English)
    0 references
    0 references
    5 July 1995
    0 references
    0 references
    matching problem
    0 references
    odd \(T\)-disconnector
    0 references