Abstract
We present the first polynomial-time algorithm for the problem of subgraph isomorphism for two-connected series-parallel graphs, using a new decomposition technique. We also show that this problem is in random NC, and that it is in NC if the input graphs are of bounded valence.
This research was partially supported by the grant RP.I.Z09 from the Institute of Informatics, University of Warsaw. Hospitality of the Department of Computer and Information Science at Linköping University where this work has been concluded is gratefully acknowledged.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, Massachusetts, 1974).
S.A. Cook, The taxonomy of problems with fast parallel algorithms, Information and Control 64 (1985), pp. 2–22.
G. Cornuejols, J. Fonlupt and D. Naddef, The traveling salesman problem on a graph and some related integer polyhedra, Mathematical Programming 33 (1985), pp. 1–27.
R.J. Duffin, Topology of series-parallel graphs, J. Math. and Appl. 10(1965), 303–318.
M.R. Garey, D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness (Freeman, San Francisco, 1979).
P.B. Gibbons, R.M. Karp, G.L. Miller and D. Soroker, Subtree isomorphism is in random NC, manuscript, September 1987.
F. Harary, Graph Theory (Addison-Wesley, Reading, Massachusetts, 1969).
J. Hopcroft, R. Karp, An n 5/2 algorithm for maximum matching in bipartite graphs, SIAM J.Comput., 4:4.
R. Hassim, A. Tamir, Efficient algorithms for optimization and selection on series-parallel graphs, SIAM J. Alg. Disc. Math. 7(1986), 379–389.
J. Hopcroft, R.E. Tarjan, Isomorphism of planar graphs, in Proc. 4th Ann. Symposium on Theory of Computing (1980).
A. Lingas, Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time, in Proc. 3rd STACS's, Orsay (1986), LNCS 210, Springer, to appear in Theoretical Computer Science.
A. Lingas and M. Karpinski, Subtree isomorphism and bipartite perfect matching are mutually NC reducible, technical report, LITH-IDA-R-87-09, Linköping University, May 1987.
A. Lingas and A. Proskurowski, Fast Parallel Algorithms for the Subgraph Homeomorphism and the Subgraph Isomorphism Problems for Classes of Planar Graphs, in Proc. the 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Puna, India 1987, LNCS, Springer.
R.J. Lipton and R.E. Tarjan, Applications of a planar separator theorem, SIAM J. Computing 9 (1980) no. 3, 513–524.
D. W. Matula, Subtree isomorphism in O(n 5/2), Annals of Discrete Mathematics 2 (1978) 91–406.
K. Mulmuley, U.V. Vazirani and V.V. Vazirani, Matching is as easy as matrix inversion, Proc. 19th STOC, 1987, pp. 345–354.
S. W. Reyner, An analysis of a good algorithm for the subtree problem, SIAM J. Comput. 6 (1977), 730–732.
N. Robertson and P.D. Seymour, Disjoint paths — a survey, SIAM J. Alg. Disc. Meth., Vol. 6 (1985), No. 2, 300–305.
J.A. Wald, C.J. Colbourn, Steiner trees, Partial 2-tress and minimum IFI networks, Networks 13 (1983), 154–167.
M.M. Sysło, The subgraph isomorphism problem for outerplanar graphs, Theoretical Computer Science 17 (1982), 91–97.
S. Shinoda, Y. Kajitani, K. Onaga, W. Mayeda, Various characterizations of seriesparallel graphs, Proceedings of ISCAS, 1979, pp. 100–103.
L. Stockmeyer and U. Vishkin, Simulation of parallel random Access Machines by Circuits, SIAM J. Compt. 13 (1984), pp. 409–422.
Y. Shiloach and U. Vishkin, An O(log n) parallel connectivity algorithm, J. Algorithms 3, 1, pp. 57–67.
K. Takamizawa, T. Nishizeki, N. Saito, Linear-time computability of Combinatorial problems on series-parallel graphs, J. ACM 29 (1982), 623–641.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lingas, A., Sysło, M.M. (1988). A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs. In: Lepistö, T., Salomaa, A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19488-6_130
Download citation
DOI: https://doi.org/10.1007/3-540-19488-6_130
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19488-0
Online ISBN: 978-3-540-39291-0
eBook Packages: Springer Book Archive