Graph inference from a walk for trees of bounded degree 3 is NP-complete (Q3569017)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph inference from a walk for trees of bounded degree 3 is NP-complete |
scientific article |
Statements
Graph inference from a walk for trees of bounded degree 3 is NP-complete (English)
0 references
17 June 2010
0 references
