Algorithm for finding one of the largest common subgraphs of two three-dimensional graph structures

Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

Volumn 81, Issue 9, 1998, Pages 48-53

  Masuda, Sumio ^a,b,c,d   Yoshioka, Hiroyuki ^a   Tanaka, Eiichi ^a,b,d,e,f  

^a KOBE UNIVERSITY   (Japan)

^b OSAKA UNIVERSITY   (Japan)

^c Grad Sch Dr Eng   (Japan)

^d IEEE

^e Osaka Prefecture University   (Japan)

^f UTSUNOMIYA UNIVERSITY   (Japan)

Author keywords

Algorithm; Computational complexity; Graph; Largest common subgraph

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

LARGEST COMMON SUBGRAPH;

TREES (MATHEMATICS);

EID: 0032167342     PISSN: 10420967     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6440(199809)81:9<48::AID-ECJC6>3.0.CO;2-V     Document Type: Article

References (13)

1. M.R. Garey and D.S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA (1979).
2. S. Ono (ed.). Computed Chemistry. Maruzen Co. (1988).
3. M.M. Cone, R. Venkataraghavan, and F.W. McLafferty. Molecular structure comparison program for the identification of maximal common substructures. J. Am. Chem. Soc., 99, No. 23, pp. 7668-7671 (Nov. 1977).
4. Y. Takahashi, Y. Satoh, H. Suzuki, and S. Sasaki, Recognition of largest common structural fragment among a variety of chemical structures. Analytical Sciences, 3, pp. 23-28 (Feb. 1987).
5. D.M. Bayada, R.W. Simpson, and A.P. Johnson, An algorithm for the multiple common subgraph problem. J. Chem. Inf. Comput. Sci., 32, No. 6, pp. 680-685 (1992).
6. T. Akutsu. An RNC algorithm for finding a largest common subtree of two trees. I.E.I.C.E. Trans. Inf. & Syst., E75-D, No. 1, pp. 95-101 (Jan. 1992).
7. T. Akutsu. A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. I.E.I.C.E. Trans. Fundamentals, E76-A, No. 9, pp. 1488-1493 (Sept. 1993).
8. S. Masuda, L Mori, and E. Tanaka. An algorithm to find the largest common subgraph of two trees. Trans. I.E.I.C.E.J. (A), J77, No. 3, pp. 460-470 (March 1994).
9. Y. Takahashi, S. Maeda, and S. Sasaki. Automated recognition of common geometrical patterns among a variety of three-dimensional molecular structures. Analytica Chimica Acta, 200, pp. 363-377 (1987).
10. J.-P. Doucet and J. Weber. Computer-Aided Molecular Design. Academic Press, London (1996).
11. T. Akutsu. On approximability of the largest common point set of multiple point sets. Information Processing Society of Japan Research Reports, AL33-9 (May 1993).
12. R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36, No. 2, pp. 177-189 (April 1979).
13. T. Nishizeki and N. Chiba. Planar graphs - theory and algorithms. Annals of Disc. Math., 32, North-Holland, Amsterdam (1988).