16 citations · 41 across the 20 of their papers we have counts for
4 papers · 1 filter
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…
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times mai…
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…