Node and edge averaged complexities of local graph problems

Node and edge averaged complexities of local graph problems

Abstract We continue the recently started line of work on the distributed node-averaged complexity of distributed graph algorithms. The node-averaged complexity of a distributed algorithm running on a graph $$G=(V,E)$$...

Full description

Bibliographic Details
Main Authors: Balliu, Alkida, Ghaffari, Mohsen, Kuhn, Fabian, Olivetti, Dennis
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: Springer Berlin Heidelberg 2023
Online Access:https://hdl.handle.net/1721.1/151070

Internet

https://hdl.handle.net/1721.1/151070

Similar Items