Parallel strong orientation of an undirected graph-Reference-Cited by-同舟云学术

Parallel strong orientation of an undirected graph

Published:1984-01 Issue:1 Volume:18 Page:37-39
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Atallah Mikhail J.

Publisher

Elsevier BV

Subject

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

Reference5 articles.

1. Parallel algorithms for the transitive closure and the connected components problems;Hirschberg;Proc. 8th Ann. ACM Symp. on Theory of Computing,1976

2. Parallel algorithms in graph theory: Planarity testing;Ja'Ja';SIAM J. Comput.,1982

3. New parallel sorting schemes;Preparata;IEEE Trans. Comput.,1978

4. Parallel algorithms for graph theoretic problems;Savage,1977

5. Fast, efficient parallel algorithms for some graph problems;Savage;SIAM J. Comput.,1981

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

1. On the optimal strongly connected orientations of city street graphs IV: Four east-west avenues or north-south streets;Discrete Applied Mathematics;1994-03

2. Parallel search algorithms for graphs and trees;Information Sciences;1993-01

3. New Directions in Graph Theory (With an Emphasis on the Role of Applications);Quo Vadis, Graph Theory? - A Source Book for Challenges and Directions;1993

4. On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets;Networks;1992-03

5. Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms;Information and Computation;1991-05