Login / Signup

Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs.

Gabriel Istrate
Published in: Theor. Comput. Sci. (2015)
Keyphrases