On the minimum monochromatic or multicolored subgraph partition problems (Q2456352)
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: On the minimum monochromatic or multicolored subgraph partition problems |
scientific article; zbMATH DE number 5201829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum monochromatic or multicolored subgraph partition problems |
scientific article; zbMATH DE number 5201829 |
Statements
On the minimum monochromatic or multicolored subgraph partition problems (English)
0 references
18 October 2007
0 references
monochromatic
0 references
multicolored
0 references
partition
0 references
complexity
0 references
inapproximability
0 references
0 references
0.8627170920372009
0 references
0.8549216389656067
0 references
0.8509407043457031
0 references
0.8034199476242065
0 references
0.8002209067344666
0 references
