A parallel algorithm for eliminating cycles in undirected graphs-Reference-Cited by-同舟云学术

A parallel algorithm for eliminating cycles in undirected graphs

Author:

Klein Philip,Stein Clifford

Publisher

Elsevier BV

Subject

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

Reference14 articles.

1. Deterministic parallel list ranking;Anderson,1988

2. Finding Euler circuits in algorithmic parallel time;Awerbach;Proc. 16th Annual ACM Symposium on Theory of Computing,1984

3. Optimal parallel algorithms for expression tree evaluation and list ranking;Cole,1988

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

1. Parallel Privacy-preserving Computation of Minimum Spanning Trees;Proceedings of the 7th International Conference on Information Systems Security and Privacy;2021

2. A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2013

4. An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2008-09-01