Approximating maximum edge 2-coloring in simple graphs via local improvement (Q1035687)
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 via local improvement |
scientific article; zbMATH DE number 5624936
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating maximum edge 2-coloring in simple graphs via local improvement |
scientific article; zbMATH DE number 5624936 |
Statements
Approximating maximum edge 2-coloring in simple graphs via local improvement (English)
0 references
4 November 2009
0 references
approximation algorithms
0 references
graph algorithms
0 references
edge coloring
0 references
NP-hardness
0 references
