1. R. Cole and U. Vishkin, “Approximate and exact parallel scheduling with applications to list, tree, and graph problems,” Proc. 27th Symp. Found. Comp. Sci., 1986, pp. 478–491.
2. S. Even, Graph Algorithms, Computer Science Press, Rockville, MD, 1979.
3. D. Fussell and R. Thurimella, “Separation pair detection,” VLSI Algorithms and Architectures, Springer-Verlag LNCS, vol. 319, 1988, pp. 149–159.
4. J. E. Hopcroft, and R. E. Tarjan, “Finding the triconnected components of a graph,” TR 72–140, Computer Science Department, Cornell University, Ithaca, NY, 1972.
5. J. E. Hopcroft, and R. E. Tarjan, “Dividing a graph into triconnected components,” SIAM J. Computing, vol. 2, 1973, pp. 135–158.