Author:
Miller Gary L.,Ramachandran Vijaya
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. R. Cole: Parallel merge sort,SIAM J. Comput. 17 (1988), 770?785.
2. R. Cole, U. Vishkin: Approximate and exact parallel scheduling with applications to list, tree and graph problems,Proc. 27th Ann. IEEE Symp. on Foundations of Comp. Sci. 1986, 478?491.
3. S. Even:Graph Algorithms, Computer Science Press, Rockville, MD, 1979.
4. J. E. Hopcroft, R. E. Tarjan: Dividing a graph into triconnected components,SIAM J. Comput. 2 (1973), 135?158.
5. J. E. Hopcroft, R. E. Tarjan: Finding the triconnected components of a graph, TR 72-140, Computer Science Department, Cornell University, Ithaca, NY, 1972.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Planar Graph Isomorphism Is in Log-Space;ACM Transactions on Computation Theory;2022-06-30
2. Efficient Distributed Algorithms in the k-machine model via PRAM Simulations;2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2021-05
3. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable;ACM Transactions on Parallel Computing;2021-04
4. Expediting Parallel Graph Connectivity Algorithms;2018 IEEE 25th International Conference on High Performance Computing (HiPC);2018-12
5. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable;Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures;2018-07-11