Reconfiguring shortest paths in graphs (Q6623589)
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: Reconfiguring shortest paths in graphs |
scientific article; zbMATH DE number 7931155
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reconfiguring shortest paths in graphs |
scientific article; zbMATH DE number 7931155 |
Statements
Reconfiguring shortest paths in graphs (English)
0 references
24 October 2024
0 references
reconfiguration
0 references
shortest path
0 references
PSPACE-complete
0 references
circle graph
0 references
Boolean hypercube
0 references
bridged graph
0 references
line graph
0 references
hardness of approximation
0 references
0 references
0 references
0 references
0 references
