Faster scaling algorithms for general graph matching problems (Q4302856)

From MaRDI portal
Revision as of 15:09, 29 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127782667, #quickstatements; #temporary_batch_1722261696779)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 622336
Language Label Description Also known as
English
Faster scaling algorithms for general graph matching problems
scientific article; zbMATH DE number 622336

    Statements

    Faster scaling algorithms for general graph matching problems (English)
    0 references
    0 references
    0 references
    6 October 1994
    0 references
    augmenting path
    0 references
    blossom
    0 references
    network optimization
    0 references
    scaling
    0 references
    minimum-cost matching
    0 references
    travelling salesman
    0 references
    linear programming
    0 references

    Identifiers

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