Graph inference from a walk for trees of bounded degree 3 is NP-complete (Q3569017)
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: Graph inference from a walk for trees of bounded degree 3 is NP-complete |
scientific article; zbMATH DE number 5723003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph inference from a walk for trees of bounded degree 3 is NP-complete |
scientific article; zbMATH DE number 5723003 |
Statements
Graph inference from a walk for trees of bounded degree 3 is NP-complete (English)
0 references
17 June 2010
0 references
0.8854997158050537
0 references
0.8661928176879883
0 references
0.8331900835037231
0 references
