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

Additionally, novel distributed discrete-time algorithms have been developed for convex optimisation over directed networks by incorporating momentum terms and gradient tracking techniques ...

Dimitri P. Bertsekas, The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial, Interfaces, Vol. 20, No. 4, The Practice of Mathematical ...