Pages that link to "Item:Q517018"
From MaRDI portal
The following pages link to The complexity of dominating set reconfiguration (Q517018):
Displaying 25 items.
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Cut-colorings in coloring graphs (Q1733874) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- Reconfiguring dominating sets in minor-closed graph classes (Q2053687) (← links)
- Reconfiguration graphs for dominating sets (Q2073197) (← links)
- Irredundance graphs (Q2081464) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- TS-reconfiguration of dominating sets in circle and circular-arc graphs (Q2140491) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Complexity of Hamiltonian cycle reconfiguration (Q2633261) (← links)
- Irredundance trees of diameter 3 (Q2675840) (← links)
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (Q5041181) (← links)
- Reconfiguring Minimum Dominating Sets in Trees (Q5216280) (← links)
- On k-Total Dominating Graphs (Q5377032) (← links)
- Reconfiguration of Spanning Trees with Many or Few Leaves (Q5874492) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Fixed-parameter algorithms for graph constraint logic (Q6041672) (← links)
- Linear transformations between dominating sets in the TAR-model (Q6087209) (← links)
- (Q6089660) (← links)
- (Q6089671) (← links)
- Hamiltonian cycle reconfiguration with answer set programming (Q6545539) (← links)
- Recongo: bounded combinatorial reconfiguration with answer set programming (Q6545541) (← links)
- Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis (Q6575399) (← links)
