Faster Subtree Isomorphism

Journal of Algorithms

Volumn 33, Issue 2, 1999, Pages 267-280

  Shamir, Ron ^a   Tsur, Dekel ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242614382     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1044     Document Type: Article

References (25)

1. S. Anderson, Graphical representation of molecules and substructure-search queries in MACCS, J. Mol. Graphics 2 (1984), 8-90.
2. M. Behzad, G. Chartrand, and L. Lesniak-Foster, "Graphs & Digraphs," Wadsworth, Belmont, CA, 1979.
3. J. Cheriyan, Randomized Õ(M(|V|)) algorithms for problems im matching theory, SIAM J. Comput. 26 (1997), 1635-1655.
4. 2.5) time algorithms for the subgraph homeomorphism problem on trees, J. Algorithms 8 (1987), 106-112.
5. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990), 23-52.
6. A. Dessmark, A. Lingas, and A. Proskurowski, Faster algorithms for subgraph isomorphism of k-connected partial k-trees, in "Proceedings, Fourth European Symposium on Algorithms, (ESA 96)," pp. 501-513, Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York, 1996.
7. E. A. Dinic, An algorithm for solution of a problem of maximum flow in a network with power estimation, Soviet Math. Doklady 11 (1970), 1277-1280.
8. S. Even, "Graph Algorithms," Computer Science Press, Rockville, MD, 1979.
9. T. Feder and R. Motwani, Clique partitions, graph compression and speeding-up algorithms, in "Proceedings, 23rd Symposium on the Theory of Computing (STOC 91)," pp. 123-33, Am. Chem. Soc., Washington, DC, 1991.
10. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
11. P. B. Gibbons, R. M. Karp, G. L. Miller, and D. Soroker, Subtree isomorphism is in random NC, Discrete Appl. Math. 29 (1990), 35-62.
12. 5/2 algorithm for maximum matching in bipartite graphs, SIAM J. Comput. 2 (1973), 225-231.
13. J. E. Hopcroft and R. E. Tarjan, Isomorphism of planar graphs, in "Complexity of Computer Computations" (R. E. Miller and J. W. Thatcher, Eds.), pp. 131-152, Plenum, New York, 1972.
14. O. H. Ibarra, S. Moran, and R. Hui, A generalization of the fast LUP matrix decomposition algorithm and applications, J. Algorithms 3 (1982), 45-46.
15. M. Karpinski and A. Lingas, Subtree isomorphism is NC reducible to bipartite perfect matching, Inform. Process. Lett. 30, No. 1 (1989), 27-32.
16. A. Lingas, Subgraph isomorphism for biconnected outerplanar graphs in cubic time, Theoret. Comput. Sci. 63 (1989), 295-302.
17. A. Lingas and M. M. Syslo, A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs, in "Proceedings, 15th Int. Colloq. Automata, Languages and Programming," pp. 394-409, Lecture Notes in Computer Science, Vol. 317, Springer-Verlag, Berlin/New York, 1988.
18. L. Lovasz and M. D. Plummer, "Matching Theory," North-Holland, Amsterdam, 1986.
19. J. Matoušek and R. Thomas, On the complexity of finding iso- and other morphisms for partial k-trees, Discrete Math. 108 (1992), 343-364.
20. D. W. Matula, An algorithm for subtree identification, SIAM Rev. 10 (1968), 273-274.
21. 5/2), Ann. Discrete Math. 2 (1978), 91-106.
22. A. M. Odlyzko, Asymptotic enumeration methods, in "Handbook of Combinatorics" (R. L. Graham, M. Grotschel, and L. Lovasz, Eds.), Vol. 2, pp. 1063-1229, Elsevier and MIT Press, Cambridge, MA, 1995.
23. R. Shamir and D. Tsur, The maximum subforest problem: Approximation and exact algorithms, in "Proceedings, Ninth Symposium on Discrete Algorithms (SODA 98)," pp. 394-399, Am. Chem. Soc., Washington, DC, 1998.
24. R. E. Stobaugh, Chemical substructure searching, J. Chem. Inform. Comput. Sci. 25 (1985), 271-275.
25. R. E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1 (1972), 146-160.