Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees-Reference-Cited by-同舟云学术

Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees

Published:1988-04 Issue:5 Volume:27 Page:227-236
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Jung Hermann,Mehlhorn Kurt

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference9 articles.

1. Deterministic coin tossing with applications to optimal parallel list ranking;Cole;Inform. & Control,1986

2. Approximate and exact parallel scheduling with applications to list, tree and graph problems;Cole;27th Conf. on Fundamentals of Computer Science,1986

3. R. Cole and U. Vishkin, Faster optimal parallel prefix sums and list ranking, Inform. & Control, to appear.

4. Parallel symmetry breaking in sparse graphs;Goldberg;19th Symp. on Theory of Computing,1987

5. Parallel 5-coloring of planar graphs;Hagerup,1987

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

1. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Clique, Independent Set, and Vertex Cover;Texts in Computer Science;2021

3. Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06

4. Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph;Cybernetics and Systems Analysis;2006-01

5. Improving a solution's quality through parallel processing;The Journal of Supercomputing;2001