The Complexity of the List Partition Problem for Graphs (Q3544241)
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: The Complexity of the List Partition Problem for Graphs |
scientific article; zbMATH DE number 5378725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of the List Partition Problem for Graphs |
scientific article; zbMATH DE number 5378725 |
Statements
The Complexity of the List Partition Problem for Graphs (English)
0 references
5 December 2008
0 references
graph partition
0 references
list partition
0 references
complexity
0 references
algorithm
0 references
0.9741610884666444
0 references
0.883259117603302
0 references
0.8492802977561951
0 references
0.8338006138801575
0 references
