A 1-matching blossom-type algorithm for edge covering problems (Q3956416): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modification of Edmonds' maximum matching algorithm / rank
 
Normal rank

Revision as of 15:46, 13 June 2024

scientific article
Language Label Description Also known as
English
A 1-matching blossom-type algorithm for edge covering problems
scientific article

    Statements

    A 1-matching blossom-type algorithm for edge covering problems (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    minimum cost edge cover
    0 references
    undirected network
    0 references
    worst case computational complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references