A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph (Q4291501)

From MaRDI portal
Revision as of 15:31, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article; zbMATH DE number 566390
Language Label Description Also known as
English
A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
scientific article; zbMATH DE number 566390

    Statements

    A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph (English)
    0 references
    10 May 1994
    0 references
    minimum cost perfect two-matching
    0 references
    weighted undirected graph
    0 references
    network flow algorithm
    0 references

    Identifiers