The complexity of rerouting shortest paths (Q392173): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2013.09.012 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1504277002 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1009.3217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of the graph of vertex-colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing 3-colourings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motion planning with pulley, rope, and baskets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Reconfiguration Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of List Edge-Colorings in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths between shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Paths between Shortest Paths and Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2013.09.012 / rank
 
Normal rank

Latest revision as of 16:15, 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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references