The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (Q903370)
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,) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy |
scientific article; zbMATH DE number 6526581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy |
scientific article; zbMATH DE number 6526581 |
Statements
The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (English)
0 references
5 January 2016
0 references
probe graphs
0 references
partition problems
0 references
graph algorithms
0 references
0.9568551182746888
0 references
0.8510419726371765
0 references
0.8020597100257874
0 references
0.7966155409812927
0 references
0.7914604544639587
0 references
