The complexity of rerouting shortest paths (Q392173)
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 6244706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of rerouting shortest paths |
scientific article; zbMATH DE number 6244706 |
Statements
The complexity of rerouting shortest paths (English)
0 references
13 January 2014
0 references
shortest path
0 references
reconfiguration
0 references
rechability
0 references
PSPACE-hard
0 references
claw-free graph
0 references
chordal graph
0 references
0 references
0.9668319821357728
0 references
0.9066768288612366
0 references
0.9065552949905396
0 references
0.8814377188682556
0 references
0.8248841762542725
0 references
