4 citations · 5 across the 5 of their papers we have counts for
5 papers
The Complexity of (List) Edge-Coloring Reconfiguration Problem
Hiroki Osawa, Akira Suzuki, Takehiro Ito +1
Let be a graph such that each edge has its list of available colors, and assume that each list is a subset of the common set consisting of colors. Suppose that we are given…
Reconfiguration of Cliques in a Graph
Takehiro Ito, Hirotaka Ono, Yota Otachi
We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-st…
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs
Takehiro Ito, Yota Otachi, Toshiki Saitoh +6
Consider an undirected graph modeling a social network, where the vertices represent users, and the edges do connections among them. In the competitive diffusion game, each of a nu…
Linear-Time Algorithm for Sliding Tokens on Trees
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein +6
Suppose that we are given two independent sets and of a graph such that , and imagine that a token is placed on each vertex in . Then, the sliding tok…
Fixed-Parameter Tractability of Token Jumping on Planar Graphs
Takehiro Ito, Marcin Kamiński, Hirotaka Ono
Suppose that we are given two independent sets and of a graph such that , and imagine that a token is placed on each vertex in . The token jumping p…