Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs

@article{Khuller1991EfficientPA,
  title={Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs},
  author={Samir Khuller and Baruch Schieber},
  journal={SIAM J. Comput.},
  year={1991},
  volume={20},
  pages={352-375}
}

From This Paper

Figures and tables from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

An approach to the subgraph homeomorphism problem , Theoret

  • W. DEGENHARDT, J. DOENHARDT, +4 authors H. ROHNERT
  • Comput . Sci .
  • 1985

Similar Papers

Loading similar papers…