On a Greedy Heuristic for Complete Matching (Q3922185)

From MaRDI portal
Revision as of 16:58, 20 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On a Greedy Heuristic for Complete Matching
scientific article

    Statements

    On a Greedy Heuristic for Complete Matching (English)
    0 references
    0 references
    0 references
    1981
    0 references
    drawing graphs on a mechanical plotter
    0 references
    graph algorithms
    0 references
    analysis of algorithms
    0 references

    Identifiers