Samir Khuller, Baruch Schieber. Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary). In 30th Annual Symposium on Foundations of Computer Science, 30 October-1 November 1989, Research Triangle Park, North Carolina, USA. pages 288-293, IEEE, 1989.
@inproceedings{KhullerS89, title = {Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)}, author = {Samir Khuller and Baruch Schieber}, year = {1989}, tags = {testing, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/KhullerS89}, cites = {0}, citedby = {0}, pages = {288-293}, booktitle = {30th Annual Symposium on Foundations of Computer Science, 30 October-1 November 1989, Research Triangle Park, North Carolina, USA}, publisher = {IEEE}, }