7 citations · 17 across the 16 of their papers we have counts for
1 paper · 1 filter
Koji M. Kobayashi
The online dominating set problem is an online variant of the minimum dominating set problem, which is one of the most important NP-hard problems on graphs. This problem is defined…