Finding shortest paths between graph colourings (Q309791): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1573626259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Rerouting Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set Reconfiguration in Cographs / 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: The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguring Independent Sets in Claw-Free Graphs / 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: Incompressibility through Colors and IDs / 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: The complexity of change / 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: Reconfiguration of List L(2,1)-Labelings in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of the Subset Sum Reconfiguration Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths between shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover Reconfiguration and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism reconfiguration via homotopy / rank
 
Normal rank

Latest revision as of 13:49, 12 July 2024

scientific article
Language Label Description Also known as
English
Finding shortest paths between graph colourings
scientific article

    Statements

    Finding shortest paths between graph colourings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    graph colouring
    0 references
    graph algorithms
    0 references
    reconfigurations
    0 references
    reconfiguration graphs
    0 references
    fixed parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references