Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph

@inproceedings{Khuller1989ProcessorEP,
  title={Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph},
  author={Samir Khuller and Stephen G. Mitchell and Vijay V. Vazirani},
  booktitle={FOCS},
  year={1989}
}
An important step in solvin the general problem is solving the planar case. A pofynomial time a1 orithm for this case was given by Per1 and Shiloach fPS 781. Shiloach [Sh 801 showed how to solve the non-planar case as follows: Find a Kuratowski homeomorphif it is a K3,3 homeomorph, then use it as a high connectivity “switch” to find the two disjoint paths; if it is a K5 homeomorph, use the algorithm of [Wa 68 . Independently, Seymour [Se 801 gave a polynomi a time algorithm for the decision… CONTINUE READING

From This Paper

Topics from this paper.
2 Citations
9 References
Similar Papers

References

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

Graph Minors XI11 The disjoint paths problem,

  • N. Robertson, P. D. Seymour
  • 1986

Graph Minors XVI: Wagner’s Conjecture,

  • N. Robertson, P. D. Seymour
  • 1986

Disjoint paths-a survey,

  • N. Robertson, P. D. Seymour
  • SIAM Journal of Algebraic and Discrete Methods 6,
  • 1985

2-isomorphic graphs,

  • H. Whitney
  • A m . J. of Math
  • 1933

Similar Papers

Loading similar papers…