The polynomial dichotomy for three nonempty part sandwich problems (Q5901068)
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 polynomial dichotomy for three nonempty part sandwich problems |
scientific article; zbMATH DE number 5770504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The polynomial dichotomy for three nonempty part sandwich problems |
scientific article; zbMATH DE number 5770504 |
Statements
The polynomial dichotomy for three nonempty part sandwich problems (English)
0 references
13 August 2010
0 references
graph partitions
0 references
sandwich problems
0 references
graph algorithms
0 references
computational complexity
0 references
structural characterization of graphs
0 references
NP-complete
0 references
0.8224827647209167
0 references
0.8040100336074829
0 references
0.7816520929336548
0 references
0.7735300064086914
0 references
0.7732171416282654
0 references
