Parallel ear decomposition search (EDS) and st-numbering in graphs-Reference-Cited by-同舟云学术

Parallel ear decomposition search (EDS) and st-numbering in graphs

Published:1986 Issue: Volume: Page:34-45
ISSN:0302-9743
Container-title:VLSI Algorithms and Architectures
language:
Short-container-title:

Author:

Maon Yael,Schieber Baruch,Vishkin Uzi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-16766-8_4

Reference15 articles.

1. Anderson, R., "A Parallel Algorithm for the Maximal Path Problem", Proc. 17th ACM Symp. on Theory of Computing (1985), pp. 33–37.

2. Cole, R. and Vishkin, U., "Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms", Proc. 18th ACM Symp. on Theory of Computing (1986), to appear.

3. Even, S., "Graph Algorithms", Computer Science Press, 1979.

4. Even, S., and Tarjan, R.E., "Computing an st-numbering", Th. Comp. Science 2 (1976), pp. 339–344.

5. Itai, A. and Rodeh, M., "The Multi-Tree Approach to Reliability in Distributed Networks", Proc. 25th Symp. on Foundations of Comp. Science (1984), pp. 137–147.

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

1. Aquila: Adaptive Parallel Computation of Graph Connectivity Queries;Proceedings of the 29th International Symposium on High-Performance Parallel and Distributed Computing;2020-06-21

2. A parallel algorithm for approximating the minimum cycle cover;Algorithmica;1993-01

3. Ranking Planar Embeddings Using PQ-Trees;Quo Vadis, Graph Theory? - A Source Book for Challenges and Directions;1993

4. A framework for parallel graph algorithm design;Lecture Notes in Computer Science;1989

5. Fast Parallel Algorithms for Reducible Flow Graphs;Concurrent Computations;1988