The complexity of rerouting shortest paths (Q392173): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2013.09.012 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2013.09.012 / rank | |||
Normal rank | |||
Revision as of 00:52, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of rerouting shortest paths |
scientific article |
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
