Hardness of finding combinatorial shortest paths on graph associahedra (Q6638085)
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: Hardness of finding combinatorial shortest paths on graph associahedra |
scientific article; zbMATH DE number 7944120
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of finding combinatorial shortest paths on graph associahedra |
scientific article; zbMATH DE number 7944120 |
Statements
Hardness of finding combinatorial shortest paths on graph associahedra (English)
0 references
14 November 2024
0 references
graph associahedra
0 references
combinatorial shortest path
0 references
NP-hardness
0 references
polymatroids
0 references
