Node and Edge Averaged Complexities of Local Graph Problems

DOI10.1145/3519270.3538419MaRDI QIDQ6201992zbMATH OpenFDO

Authors Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti

Publication date 26 March 2024

Published in Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

lower boundsmaximal independent setupper boundsmaximal matchinglocal modelruling setssinkless orientationnode and edge average complexity

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

This page was built for publication: Node and Edge Averaged Complexities of Local Graph Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201992)