Approximating maximum edge 2-coloring in simple graphs (Q3578359)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5758185
| 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 5758185 |
Statements
Approximating Maximum Edge 2-Coloring in Simple Graphs (English)
0 references
20 July 2010
0 references
approximation algorithms
0 references
graph algorithms
0 references
edge coloring
0 references
NP-hardness
0 references
0.9937803745269777
0 references
0.9737378358840942
0 references
0.9672790765762328
0 references
0.9661934971809388
0 references
0.9633722305297852
0 references
