Improving a family of approximation algorithms to edge color multigraphs (Q293395): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On edge-colorings of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better than “best possible” algorithm to edge color multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $1.1$ Edge-Coloring of Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional covers for forests and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte / rank
 
Normal rank

Revision as of 02:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Improving a family of approximation algorithms to edge color multigraphs
scientific article

    Statements

    Improving a family of approximation algorithms to edge color multigraphs (English)
    0 references
    0 references
    0 references
    9 June 2016
    0 references
    edge coloring
    0 references
    approximation algorithm
    0 references
    matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references