Author:
Fussell Donald,Thurimella Ramakrishna
Reference6 articles.
1. M. Ajtai, J. Komlos and E. Szemeredi, “An O(n log n) sorting network,” Combinatorica 3:1, 1983, pp. 1–19.
2. D. Fussell and R. Thurimella, “Finding a sparse graph that preserves biconnectivity,” manuscript.
3. G.L. Miller and V. Ramachandran, “A new triconnectivity algorithm and its applications,” Proc. 19th annual STOC, NY, May 1987, pp. 335–344.
4. Y. Maon, B. Schieber and U. Vishkin, “Parallel ear decomposition search (EDS) and ST-numbering in graphs,” VLSI Algorithms and Architectures, Lecture Notes in Computer Science Vol. 227, 1986, pp. 34–45.
5. Y. Shiloach and U. Vishkin, “An O(log n) parallel connectivity algorithm,” J. Algorithms 2, (1981), pp. 57–63.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献