Approximating the maximum 3- and 4-edge-colorable subgraph (extended abstract) (Q3569908)
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 the maximum 3- and 4-edge-colorable subgraph (extended abstract) |
scientific article; zbMATH DE number 5724338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the maximum 3- and 4-edge-colorable subgraph (extended abstract) |
scientific article; zbMATH DE number 5724338 |
Statements
Approximating the Maximum 3- and 4-Edge-Colorable Subgraph (English)
0 references
22 June 2010
0 references
0.8965553045272827
0 references
0.8843514323234558
0 references
0.8569732904434204
0 references
0.8123159408569336
0 references
