Optimal greedy algorithms for indifference graphs (Q2365550)

From MaRDI portal
Revision as of 17:59, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal greedy algorithms for indifference graphs
scientific article

    Statements

    Optimal greedy algorithms for indifference graphs (English)
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    0 references
    indifference
    0 references
    greedy algorithms
    0 references
    coloring
    0 references
    shortest path
    0 references
    maximum matching
    0 references
    center
    0 references
    Hamiltonian path
    0 references