On the complexity of distance-d independent set reconfiguration
From MaRDI portal
Publication:6589843
DOI10.1016/J.TCS.2024.114682MaRDI QIDQ6589843FDOQ6589843
Authors: Duc A. Hoang
Publication date: 20 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
computational complexityreconfiguration problemdistance-\(d\) independent settoken slidingtoken jumping
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Theory of computing (68Qxx)
Cites Work
- Title not available (Why is that?)
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Algorithms for Square Roots of Graphs
- The complexity of change
- Graph theory
- Reconfiguring independent sets in claw-free graphs
- Games, puzzles, and computation
- Complexity of independent set reconfigurability problems
- On the complexity of reconfiguration problems
- On powers of chordal graphs and their colorings
- The complexity of rerouting shortest paths
- Title not available (Why is that?)
- Tree Powers
- Token sliding on chordal graphs
- Token sliding on split graphs
- Linear-time algorithm for sliding tokens on trees
- Parameterized complexity of graph constraint logic
- Sliding token on bipartite permutation graphs
- The maximum distance-\(d\) independent set problem on unit disk graphs
- Reconfiguration on nowhere dense graph classes
- Introduction to reconfiguration
- Title not available (Why is that?)
- Families of graphs closed under taking powers
- Computing \(k\)-independent sets for regular bipartite graphs
- On distance-\(d\) Independent Set and other problems in graphs with ``few minimal separators
- Powers of geometric intersection graphs and dispersion algorithms
- Reconfiguration in bounded bandwidth and tree-depth
- Independent set reconfiguration in cographs and their generalizations
- Distance-\(d\) independent set problems for bipartite and chordal graphs
- The complexity of independent set reconfiguration on bipartite graphs
- Title not available (Why is that?)
- Improved (In-)approximability bounds for \(d\)-scattered set
- Structurally parameterized \(d\)-scattered set
- Reconfiguring Independent Sets on Interval Graphs
- On the complexity of distance-\(d\) independent set reconfiguration
- On reconfiguration graphs of independent sets under token sliding
- Extremal independent set reconfiguration
- Independent set reconfiguration on directed graphs
This page was built for publication: On the complexity of distance-\(d\) independent set reconfiguration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589843)