article

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

Authors:

Noga Alon,

László Babai,

Alon ItaiAuthors Info & Claims

Journal of Algorithms, Volume 7, Issue 4

Pages 567 - 583

https://doi.org/10.1016/0196-6774(86)90019-2

Published: 01 December 1986 Publication History

Abstract

No abstract available.

Cited By

View all

Giakkoupis GTurau VZiccardi IKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Self-Stabilizing MIS Computation in the Beeping ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662811(87-90)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662811
Doron DMurtagh JVadhan SZuckerman D(2024)Small-Space Spectral Sparsification via Bounded-Independence SamplingACM Transactions on Computation Theory10.1145/363703416:2(1-32)Online publication date: 19-Jan-2024
https://dl.acm.org/doi/10.1145/3637034
Pattanayak DBhagat SGan Chaudhuri SMolla A(2024)Maximal Independent Set via Mobile AgentsProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631543(74-83)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631543
Show More Cited By

Index Terms

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

Recommendations

A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem
ISPAN '99: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks

This paper presents a randomized parallel algorithm for the Maximal Independent Set problem. Our algorithm uses a BSP-like computer with p processors and requires (n+m)/p larger or equal to p for a graph with n vertices and m edges. Under this ...
An improved distributed algorithm for maximal independent set
SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms

The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This paper presents a very simple randomized algorithm for this problem providing a near-optimal local complexity, which ...
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

The efficient distributed construction of a maximal independent set (MIS) of a graph is of fundamental importance. We study the problem in the class of Growth-Bounded Graphs, which includes for example the well-known Unit Disk Graphs. In contrast to the ...

Comments

Information & Contributors

Information

Published In

Journal of Algorithms Volume 7, Issue 4

Dec. 1986

153 pages

ISSN:0196-6774

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 December 1986

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

287
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Giakkoupis GTurau VZiccardi IKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Self-Stabilizing MIS Computation in the Beeping ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662811(87-90)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662811
Doron DMurtagh JVadhan SZuckerman D(2024)Small-Space Spectral Sparsification via Bounded-Independence SamplingACM Transactions on Computation Theory10.1145/363703416:2(1-32)Online publication date: 19-Jan-2024
https://dl.acm.org/doi/10.1145/3637034
Pattanayak DBhagat SGan Chaudhuri SMolla A(2024)Maximal Independent Set via Mobile AgentsProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631543(74-83)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631543
Dughmi SKalayci YPatel NMohar BShinkar IO'Donnell R(2024)Limitations of Stochastic Selection Problems with Pairwise Independent PriorsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649718(479-490)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649718
Luo JWang QLi L(2024)Succinct Quantum Testers for Closeness and k-Wise Uniformity of Probability DistributionsIEEE Transactions on Information Theory10.1109/TIT.2024.339375670:7(5092-5103)Online publication date: 25-Apr-2024
https://dl.acm.org/doi/10.1109/TIT.2024.3393756
Huang CMak WKim T(2024)CTQr: Control and Timing-Aware Qubit RoutingProceedings of the 29th Asia and South Pacific Design Automation Conference10.1109/ASP-DAC58780.2024.10473795(140-145)Online publication date: 22-Jan-2024
https://dl.acm.org/doi/10.1109/ASP-DAC58780.2024.10473795
Behnezhad SHajiaghayi MHarris D(2023)Exponentially Faster Massively Parallel Maximal MatchingJournal of the ACM10.1145/361736070:5(1-18)Online publication date: 11-Oct-2023
https://dl.acm.org/doi/10.1145/3617360
Ghaffari MPortmann JOshman RNolin AHalldorsson MBalliu A(2023)Distributed MIS with Low Energy and Time ComplexitiesProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594587(146-156)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594587
Maus YPeltonen SUitto JOshman RNolin AHalldorsson MBalliu A(2023)Distributed Symmetry Breaking on Power Graphs via SparsificationProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594579(157-167)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594579
Dufoulon FMoses WPandurangan GOshman RNolin AHalldorsson MBalliu A(2023)Distributed MIS in O(log log n) Awake ComplexityProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594574(135-145)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594574
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem

An improved distributed algorithm for maximal independent set

A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations