Pages that link to "Item:Q631762"

The following pages link to On the complexity of reconfiguration problems (Q631762):

Displaying 50 items.

• A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
• Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
• Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
• Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
• Complexity of Hamiltonian cycle reconfiguration (Q2633261) (← links)
• Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
• Reconfiguring (non-spanning) arborescences (Q2680989) (← links)
• Reconfiguring directed trees in a digraph (Q2695298) (← links)
• Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
• Computational complexity of jumping block puzzles (Q2695336) (← links)
• Reconfiguration of cliques in a graph (Q2700609) (← links)
• Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
• Reconfiguration of Steiner Trees in an Unweighted Graph (Q2819500) (← links)
• Independent Set Reconfiguration in Cographs and their Generalizations (Q2825488) (← links)
• A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
• Vertex Cover Reconfiguration and Beyond (Q2942651) (← links)
• Reconfiguration of Vertex Covers in a Graph (Q2946052) (← links)
• Degree-Constrained Subgraph Reconfiguration is in P (Q2946420) (← links)
• The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
• Sliding Tokens on Block Graphs (Q2980933) (← links)
• Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
• An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (Q3010389) (← links)
• Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
• The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
• Frozen (Δ + 1)-colourings of bounded degree graphs (Q4993126) (← links)
• (Q5026983) (← links)
• Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (Q5041181) (← links)
• Games, Puzzles and Treewidth (Q5042461) (← links)
• Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
• (Q5075806) (← links)
• (Q5090459) (← links)
• Algorithms for Coloring Reconfiguration Under Recolorability Constraints (Q5091029) (← links)
• Dismantlability, Connectedness, and Mixing in Relational Structures (Q5091178) (← links)
• Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
• Reconfiguration of Minimum Steiner Trees via Vertex Exchanges (Q5092443) (← links)
• The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
• Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266) (← links)
• Reconfiguration of Colorable Sets in Classes of Perfect Graphs (Q5116491) (← links)
• Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)
• Reconfiguring vertex colourings of 2-trees (Q5217099) (← links)
• Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
• On k-Total Dominating Graphs (Q5377032) (← links)
• Reconfiguration of Spanning Trees with Many or Few Leaves (Q5874492) (← links)
• Trichotomy for the reconfiguration problem of integer linear systems (Q5896129) (← links)
• Reconfiguring spanning and induced subgraphs (Q5916255) (← links)
• Incremental optimization of independent sets under the reconfiguration framework (Q5918743) (← links)
• Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
• Fixed-parameter algorithms for graph constraint logic (Q6041672) (← links)
• On the Connectivity of Token Graphs of Trees (Q6045414) (← links)
• Sorting balls and water: equivalence and computational complexity (Q6050130) (← links)