Approximating maximum edge 2-coloring in simple graphs (Q608271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating maximum edge 2-coloring in simple graphs |
scientific article; zbMATH DE number 5819502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating maximum edge 2-coloring in simple graphs |
scientific article; zbMATH DE number 5819502 |
Statements
Approximating maximum edge 2-coloring in simple graphs (English)
0 references
25 November 2010
0 references
approximation algorithms
0 references
graph algorithms
0 references
edge coloring
0 references
NP-hardness
0 references
0.9937803745269777
0 references
0.976858913898468
0 references
0.9766467213630676
0 references
0.9706665873527528
0 references
0.9687337875366212
0 references
