An improved approximation algorithm for maximum edge 2-coloring in simple graphs (Q935838)

From MaRDI portal
Revision as of 15:40, 7 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
An improved approximation algorithm for maximum edge 2-coloring in simple graphs
scientific article

    Statements

    An improved approximation algorithm for maximum edge 2-coloring in simple graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2008
    0 references
    approximation algorithms
    0 references
    maximum edge \(t\)-coloring
    0 references
    maximum \(b\)-matching
    0 references
    randomization
    0 references
    derandomization
    0 references

    Identifiers

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