The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050): 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.2017.02.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2591673746 / rank | |||
Normal rank | |||
Revision as of 18:23, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy |
scientific article |
Statements
The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (English)
0 references
20 December 2017
0 references
probe graphs
0 references
partition problems
0 references
graph algorithms
0 references
