Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

Distributed algorithms for graph problems represent a vibrant area of study that addresses the challenges of decentralised computation across interconnected networks. By partitioning complex graph ...