Average Awake Complexity of MIS and Matching-Reference-Cited by-同舟云学术

Average Awake Complexity of MIS and Matching

Published:2022-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Ghaffari Mohsen¹,Portmann Julian¹

Affiliation:

1. ETH Zurich, Zurich, Switzerland

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3490148.3538566

Reference33 articles.

1. A fast and simple randomized parallel algorithm for the maximal independent set problem

2. Lower Bounds for Maximal Matchings and Maximal Independent Sets

3. Alkida Balliu , Mohsen Ghaffari , Fabian Kuhn , and Dennis Olivetti . 2022. Node and Edge Averaged Complexities of Local Graph Problems. manuscript ( 2022 ). Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, and Dennis Olivetti. 2022. Node and Edge Averaged Complexities of Local Graph Problems. manuscript (2022).

4. Distributed Approximation of Maximum Independent Set and Maximum Matching

5. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The energy complexity of diameter and minimum cut computation in bounded-genus networks;Theoretical Computer Science;2024-01

2. Awake Complexity of Distributed Minimum Spanning Tree;Lecture Notes in Computer Science;2024

3. Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election;ACM Transactions on Algorithms;2023-09-26

4. Distributed MIS with Low Energy and Time Complexities;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

5. Distributed MIS in O(log log n) Awake Complexity;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16