The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2017.02.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2017.02.006 / rank | |||
Normal rank | |||
Latest revision as of 03:29, 11 December 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
0 references
0 references
