1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2021
Online Domination: The Value of Getting to Know All your Neighbors
Hovhannes Harutyunyan, Denis Pankratov, Jesse Racicot
We study the dominating set problem in an online setting. An algorithm is required to guarantee competitiveness against an adversary that reveals the input graph one node at a time…
math.CO2021★ 1 cited
Domination in Knödel Graphs
Jesse Racicot, Giovanni Rosso
Given a graph and an integer , it is an NP-complete problem to decide whether there is a dominating set of size at most . In this paper we study this problem for the Knödel G…