4 citations · 9 across the 9 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
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…
cs.DM2014
Reconfiguration of Dominating Sets
Akira Suzuki, Amer E. Mouawad, Naomi Nishimura
We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph is a set of vertices such that each vertex is either in or has a n…