Approximating the achromatic number problem on bipartite graphs (Q5897262)
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 achromatic number problem on bipartite graphs |
scientific article; zbMATH DE number 5677141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the achromatic number problem on bipartite graphs |
scientific article; zbMATH DE number 5677141 |
Statements
Algorithms - ESA 2003 (English)
0 references
3 March 2010
0 references
0.9362403154373168
0 references
0.9005569219589233
0 references
0.8976529836654663
0 references
