Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)

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.

Authors

Samir Khuller

This author has not been identified. Look up 'Samir Khuller' in Google

Baruch Schieber

This author has not been identified. Look up 'Baruch Schieber' in Google