On Girth and the Parameterized Complexity of Token Sliding and Token Jumping

@article{Bartier2020OnGA,
  title={On Girth and the Parameterized Complexity of Token Sliding and Token Jumping},
  author={Valentin Bartier and Nicolas Bousquet and Cl{\'e}ment Dallard and Kyle Lomer and Amer E. Mouawad},
  journal={Algorithmica},
  year={2020},
  volume={83},
  pages={2914 - 2951}
}
In the Token Jumping problem we are given a graph G=(V,E)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G = (V,E)$$\end{document} and two independent sets S and T of G, each of size k≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage… 

Token sliding on graphs of girth five

. In the Token Sliding problem we are given a graph G and two independent sets I s and I t in G of size k ≥ 1. The goal is to decide whether there exists a sequence (cid:104) I 1 , I 2 , . . . , I

A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems

This work considers reconfiguration variants of three fundamental underlying graph vertex-subset problems, namely Independent Set, Dominating Set, and Connected Dominating set, and surveys both older and more recent work on the parameterized complexity of all three problems when parameterized by the number of tokens k.

Galactic Token Sliding

This work introduces a new model for the reconfiguration of independent sets, which it is believed is of independent interest and could potentially help in resolving the remaining open questions concerning the (parameterized) complexity of Token Sliding.

Independent set reconfiguration on directed graphs

A linear-time algorithm for the problem on directed graphs whose underlying undirected graphs are trees, which are called polytrees, and a characterization of yes-instances based on the existence of a certain set of directed paths, which admits an e-cient algorithm.

Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH

In this article we study a well-known problem, called Bipartite Token Jumping and not-so-well known problem(s), which we call, Half (Induced-) Subgraph , and show that under Gap-ETH, these problems

No Title Given

References

SHOWING 1-10 OF 37 REFERENCES

Vertex Cover Reconfiguration and Beyond

It is shown that VCR remains w[1]-hard on bipartite graphs, is NP-hard but fixed-parameter tractable on (regular) graphs of bounded degree, and is solvable in polynomial time on trees and (with some additional restrictions) on cactus graphs.

Parameterized Complexity of Independent Set in H-Free Graphs

This paper investigates the complexity of Maximum Independent Set in the class of H -free graphs, that is, graphs excluding a fixed graph as an induced subgraph and provides a framework for solving several other cases, which is a generalization of the concept of iterative expansion accompanied by the extraction of a particular structure using Ramsey’s theorem.

Fixed-Parameter Tractability of Token Jumping on Planar Graphs

A fixed-parameter algorithm for token jumping on planar graphs, where the parameter is only the number of tokens is presented, and the algorithm can be modified so that it finds a shortest sequence for a yes-instance.

Polynomial-Time Algorithm for Sliding Tokens on Trees

The sliding token problem is shown to be solvable for trees in quadratic time, and the proof is constructive: for a yes-instance, one can find an actual sequence of independent sets between I \(_{b}\) and I \( r}\) whose length (i.e., the number of token-slides) is quadrotic.

On the Parameterized Complexity for Token Jumping on Graphs

This paper gives an FPT algorithm for general graphs when parameterized by both the number of tokens and the maximum degree, and can be modified so that it finds an actual sequence of independent sets between I 0 and I r with the minimum number of token movements.

Reconfiguration of Vertex Covers in a Graph

A linear-time algorithm is given to solve the problem for even-hole-free graphs, which include several well-known graphs, such as trees, interval graphs and chordal graphs, and gives an upper bound on \(k\) for which any pair of vertex covers in a graph G has a desired sequence.

Token Sliding on Split Graphs

This work considers the complexity of the Independent Set Reconfiguration problem under the Token Sliding rule, and shows that this problem is PSPACE-complete on split graphs (and hence also on chordal graphs), thus resolving an open problem in this area.

Reconfiguration on Sparse Graphs

Reconfiguration variants of two classical vertex-subset problems, namely Independent Set and Dominating Set, are studied and it is shown that \(\textsc {ISR}\) is fixed-parameter tractable parameterized by k when the input graph is of bounded degeneracy or nowhere dense.

A dichotomy theorem for circular colouring reconfiguration

Token Jumping in Minor-Closed Classes

Given two k-independent sets I and J of a graph G, one can ask if it is possible to transform the one into the other in such a way that, at any step, we replace one vertex of the current independent