Pages that link to "Item:Q631762"
From MaRDI portal
The following pages link to On the complexity of reconfiguration problems (Q631762):
Displayed 50 items.
- 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)
- Token sliding on graphs of girth five (Q6043182) (← links)
- On the Connectivity of Token Graphs of Trees (Q6045414) (← links)
- Sorting balls and water: equivalence and computational complexity (Q6050130) (← links)
- Reconfiguration of spanning trees with degree constraints or diameter constraints (Q6053473) (← links)
- ZDD-based algorithmic framework for solving shortest reconfiguration problems (Q6057258) (← links)
- Feedback vertex set reconfiguration in planar graphs (Q6057837) (← links)
- On reachable assignments under dichotomous preferences (Q6057838) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)
- Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs (Q6066461) (← links)
- Order Reconfiguration under Width Constraints (Q6075707) (← links)
- Inapproximability of shortest paths on perfect matching polytopes (Q6085990) (← links)
- Linear transformations between dominating sets in the TAR-model (Q6087209) (← links)
- (Q6087216) (← links)
- (Q6089660) (← links)
- (Q6089671) (← links)
- Reconfiguration of vertex-disjoint shortest paths on graphs (Q6091163) (← links)