Tight Energy Lower Bounds for Distributed Graph Algorithms
The information-theoretic technique allows the author to leverage known lower bounds on communication complexity to obtain new, almost optimal polynomial lower bounds on energy complexity for fundamental graph problems such as triangle enumeration, All-Pairs Shortest Paths, diameter computation, minimum weight cycle, M...