article

A simple parallel algorithm for the maximal independent set problem

Author:

Michael LubyAuthors Info & Claims

SIAM Journal on Computing, Volume 15, Issue 4

Pages 1036 - 1055

https://doi.org/10.1137/0215074

Published: 01 November 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 simple parallel algorithm for the maximal independent set problem

Recommendations

A Parallel Maximal Independent Set Algorithm
Read More
A linear time algorithm for the k maximal sums problem
MFCS'07: Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Finding the sub-vector with the largest sum in a sequence of n numbers is known as the maximum sum problem. Finding the k sub-vectors with the largest sums is a natural extension of this, and is known as the k maximal sums problem. In this paper we ...
Read More
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 ...
Read More

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 15, Issue 4

Nov. 1986

294 pages

ISSN:0097-5397

Editor:
S Rao Kosaraju

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 November 1986

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

403
Total Citations
View Citations
0
Total Downloads

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

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
Esfandiari HKacham PMirrokni VWoodruff DZhong PMohar BShinkar IO'Donnell R(2024)Optimal Communication Bounds for Classic Functions in the Coordinator Model and BeyondProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649742(1911-1922)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649742
Brighen ASlimani HRezgui AKheddouci H(2024)A new distributed graph coloring algorithm for large graphsCluster Computing10.1007/s10586-023-03988-x27:1(875-891)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1007/s10586-023-03988-x
Czumaj ADavies-Peck PParter M(2024)Component stability in low-space massively parallel computationDistributed Computing10.1007/s00446-024-00461-937:1(35-64)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s00446-024-00461-9
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
Giakkoupis GZiccardi IOshman RNolin AHalldorsson MBalliu A(2023)Distributed Self-Stabilizing MIS with Few States and Weak CommunicationProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594581(310-320)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594581
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
Huang SSu HOshman RNolin AHalldorsson MBalliu A(2023)(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel SettingsProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594570(44-54)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594570
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

A Parallel Maximal Independent Set Algorithm

A linear time algorithm for the k maximal sums problem

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

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations