Approximating maximum edge 2-coloring in simple graphs (Q608271)

From MaRDI portal
Revision as of 23:08, 1 July 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
Approximating maximum edge 2-coloring in simple graphs
scientific article

    Statements

    Approximating maximum edge 2-coloring in simple graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2010
    0 references
    0 references
    approximation algorithms
    0 references
    graph algorithms
    0 references
    edge coloring
    0 references
    NP-hardness
    0 references