Pages that link to "Item:Q5902502"
From MaRDI portal
The following pages link to The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (Q5902502):
Displaying 50 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- Reconfiguration of dominating sets (Q346508) (← links)
- The complexity of rerouting shortest paths (Q392173) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- On the complexity of reconfiguration problems (Q631762) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- Shortest paths between shortest paths (Q719258) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Fast recoloring of sparse graphs (Q896058) (← links)
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- The complexity of minimal satisfiability problems (Q1887137) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Multistage vertex cover (Q2135630) (← links)
- TS-reconfiguration of dominating sets in circle and circular-arc graphs (Q2140491) (← links)
- Optimal reconfiguration of optimal ladder lotteries (Q2227490) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← 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)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Recolouring homomorphisms to triangle-free reflexive graphs (Q2688244) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism (Q2817999) (← 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)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- Reconfiguration of Vertex Covers in a Graph (Q2946052) (← links)
- On the Structure of Solution-Graphs for Boolean Formulas (Q2947874) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
