Parallel algorithms for the subgraph homeomorphism problem

  • Samir Khuller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)


The subgraph homeomorphism problem for a fixed graph H is stated as follows: given a graph G, determine whether G has a subgraph homeomorphic to H, and obtain it. We study the parallel complexity of this problem for various pattern graphs H, and present fast NC algorithms for various versions of this problem. We also present an efficient NC algorithm to check if a given graph is outer-planar and to obtain its forbidden homeomorphs K4 or K2,3, if it is not.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [As 85]
    T. Asano, ‘An approach to the subgraph homeomorphism problem', Theoretical Computer Science, 38 (1985), pp. 249–267.CrossRefGoogle Scholar
  2. [BM 77]
    J.A. Bondy and U.S.R. Murty, ‘Graph Theory with applications,’ American Elsevier, New York (1977).Google Scholar
  3. [FHW 80]
    S. Fortune, J.E. Hopcroft and J. Wyllie, ‘The directed subgraph homeomorphism problem', Theoretical Computer Science, 10 (1980), pp. 111–121.CrossRefGoogle Scholar
  4. [FT 88]
    D. Fussel and R. Thurimella, ‘Separation pair detection', Proceedings of AWOC 88, LNCS 319, (1988), pp. 149–159.Google Scholar
  5. [GJ 78]
    M.R.Garey and D.S.Johnson, ‘Computers and Intractability: A guide to the theory of NP-completeness', Freeman, San Francisco.Google Scholar
  6. [Ha 43]
    D.W. Hall, ‘A note on primitive skew curves', Bull. Amer. Math. Soc., 49 (1943), pp. 935–937.Google Scholar
  7. [KMV 88]
    S.Khuller, S.G.Mitchell, V.V.Vazirani, ‘NC Algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph', Technical Report TR 88-960, Computer Science Department, Cornell University, (1988).Google Scholar
  8. [KR 86]
    P.N.Klein and J.H.Reif, ‘An efficient parallel algorithm for planarity', Proceedings of FOCS conference, (1986), pp. 465–477.Google Scholar
  9. [KS 89]
    S.Khuller and B.Schieber, ‘Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths', in preparation.Google Scholar
  10. [LR 80]
    A.S. LaPaugh and R.L. Rivest, ‘The subgraph homeomorphism problem', Journal of Computer and System Sciences, 20, (1980), pp. 133–149.Google Scholar
  11. [MSV 86]
    Y. Maon, B. Schieber and U. Vishkin, ‘Parallel ear decomposition search (EDS) and st-numbering in graphs', Theoretical Computer Science, 47 (1986), pp. 277–298.CrossRefGoogle Scholar
  12. [PS 78]
    Y. Perl and Y. Shiloach, ‘Finding two disjoint paths between two pairs of vertices in a graph', Journal of the Association for Computing Machinery, 25, (1978), pp. 1–9.Google Scholar
  13. [RS 86]
    N.Robertson and P.D.Seymour, ‘The disjoint paths problem', manuscript, (1986).Google Scholar
  14. [Sh 80]
    Y. Shiloach, ‘A polynomial solution to the undirected two path problem', Journal of the Association for Computing Machinery, 27, (1980), pp. 445–456.Google Scholar
  15. [SV 82]
    Y. Shiloach and U. Vishkin, ‘An O(log n) parallel connectivity algorithm', Journal of Algorithms, vol.3, (1982), pp 57–63.CrossRefGoogle Scholar
  16. [TV 85]
    R.E. Tarjan and U. Vishkin, ‘An efficient parallel biconnectivity algorithm', SIAM Journal on Computing, 14 (1985), pp. 862–874.MathSciNetGoogle Scholar
  17. [Va 87]
    V.V. Vazirani, ‘NC Algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems', Information and Computation 80, No. 2 (1989), pp. 152–164.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Samir Khuller
    • 1
  1. 1.Computer Science DepartmentCornell UniversityIthaca

Personalised recommendations