2 papers
cs.DM2016
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…
cs.CC2014
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…