activity
20232026
most citedExploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing 2026Show all

2 papers · 1 filter

cs.DC2026

Fast Gossip-based Rumor Spreading using Small Messages

Fabien Dufoulon, William K. Moses, Gopal Pandurangan

We study gossip algorithms for the fundamental rumor spreading problem, where the goal is to disseminate a rumor from a given source node to all nodes in an arbitrary (and unknown)…

math.CO2026

Broadcasting Agents and Adversary: A new variation on Cops and Robbers

William K. Moses, Amanda Redlich, Frederick Stock

We introduce a new game played on graphs, ``Agents and Adversary". This game is reminiscent of ``Cops and Robbers" but has some fundamental differences. We classify infinite famili…