The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy |
scientific article; zbMATH DE number 6820605
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy |
scientific article; zbMATH DE number 6820605 |
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
0.9641876
0 references
0.87927705
0 references
0.86477953
0 references
0.85681313
0 references
0.85565805
0 references
0.8501078
0 references
0.8487148
0 references
0 references
0.84441185
0 references
