The polynomial dichotomy for three nonempty part sandwich problems (Q5900084): 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.endm.2008.01.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2174934505 / rank | |||
Normal rank | |||
Revision as of 20:24, 19 March 2024
scientific article; zbMATH DE number 5284979
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The polynomial dichotomy for three nonempty part sandwich problems |
scientific article; zbMATH DE number 5284979 |
Statements
The polynomial dichotomy for three nonempty part sandwich problems (English)
0 references
5 June 2008
0 references
graph algorithms
0 references
computational complexity
0 references
structural characterization of graphs
0 references
