The polynomial dichotomy for three nonempty part sandwich problems (Q5901068): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.12.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027335394 / rank | |||
Normal rank | |||
Revision as of 20:25, 19 March 2024
scientific article; zbMATH DE number 5770504
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
