A New Parallel Algorithm for the Maximal Independent Set Problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A New Parallel Algorithm for the Maximal Independent Set Problem

Published:1989-04 Issue:2 Volume:18 Page:419-427
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Goldberg Mark,Spencer Thomas

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Link

http://epubs.siam.org/doi/pdf/10.1137/0218029

Reference12 articles.

1. Sorting inc logn parallel steps

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

3. A taxonomy of problems with fast parallel algorithms

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

1. NewSP: A New Search Process for Continuous Subgraph Matching over Dynamic Graphs;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space;ACM Transactions on Algorithms;2021-06

3. High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality;SC20: International Conference for High Performance Computing, Networking, Storage and Analysis;2020-11

4. A distributed algorithm for a maximal 2-packing set in Halin graphs;Journal of Parallel and Distributed Computing;2020-08

5. Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP