The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Luérbio Faria / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Celina M. Herrera de Figueiredo / rank | |||
Normal rank | |||
Revision as of 19:20, 28 February 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
