On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7585795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity |
scientific article; zbMATH DE number 7585795 |
Statements
On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (English)
0 references
16 September 2022
0 references
\((r,\ell)\)-graph
0 references
probe
0 references
recognition
0 references
complexity
0 references
0 references
0.8571457862854004
0 references
0.8533614277839661
0 references
0.8352375030517578
0 references
0.8303150534629822
0 references
