An approximation algorithm for zero forcing

Ben Cameron, Jeannette Janssen, Rogers Matthew +1

We give an algorithm that finds a zero forcing set which approximates the optimal size by a factor of $\text{pw}(G)+1$, where $\text{pw}(G)$ is the pathwidth of $G$. Starting from…