Advertisement

The subgraph homeomorphism problem on reducible flow graphs

  • T. Hirata
  • M. Kimura
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 108)

Abstract

We investigate the subgraph homeomorphism problem in which one would like to determine whether a fixed pattern graph is homeomorphic to a subgraph of an input graph. We show that for every fixed pattern graph, there is a polynomial-time algorithm to solve the problem if the input graphs are restricted to reducible flow graphs.

Keywords

Input Graph Disjoint Path Single Vertex Flow Graph Pattern Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    Aho, A., Hopcroft, J., and Ullman, J., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974).Google Scholar
  2. [2]
    Duffin, R. J., "Topology of series parallel networks", J. Math. and appli., 10(1965), 303–318.Google Scholar
  3. [3]
    Fortune, S., Hopcroft, J., and Wyllie, J., "The directed subgraph homeomorphism problem", Theor. Comput. Sci., 10(1980), 111–121.Google Scholar
  4. [4]
    Harary, F., Graph Theory, Addison-Wesley, Reading, Mass. (1969).Google Scholar
  5. [5]
    Hecht, M. S., and Ullman, J. D., "Flow graph reducibility", SIAM J. Computing 1,2(1972), 188–202.Google Scholar
  6. [6]
    Hecht, M. S., and Ullman, J. D., "Characterization of reducible flow graphs", J. ACM 21, 3 (1974), 367–375.Google Scholar
  7. [7]
    Hunt, H. B., and Szymansky, T. G., "Dichotomization, reachability and the forbidden subgraph problem", Proc. Eighth Annual ACM Symposium on Theory of Computing, Hershey, PA (1976), 126–134.Google Scholar
  8. [8]
    LaPaugh, A. S., and Rivest, R. L., "The subgraph homeomorphism problem", Proc. Tenth Annual ACM Symposium on Theory of Computing, San Diego, CA (1978), 40–50.Google Scholar
  9. [9]
    Perl, T., and Shiloach, Y., "Finding two disjoint paths between two paires of vertices in a graph", J. ACM 24, 1(1978), 1–9.Google Scholar
  10. [10]
    Shiloach, Y., "A polinomial solution to the undirected two paths problem", J. ACM 27, 3(1980), 445–456.Google Scholar
  11. [11]
    Tarjan, R. E., "Testing flow graph reducibility", J. Comput. and Syst. Sci., 9(1974) 355–365.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • T. Hirata
    • 1
  • M. Kimura
    • 1
  1. 1.Dept. of Information Science Faculty of EngineeringTohoku UniversitySendaiJapan

Personalised recommendations