Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees

Information Processing Letters

Volumn 92, Issue 2, 2004, Pages 57-63

  Yamaguchi, Atsuko ^a   Aoki, Kiyoko F ^a   Mamitsuka, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Computational complexity; Graph algorithms; Maximum common subgraph

Indexed keywords

ALGORITHMS; CHEMICAL COMPOUNDS; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; DATABASE SYSTEMS; MOLECULAR BIOLOGY; POLYNOMIALS; SET THEORY;

GRAPH ALGORITHMS; MAXIMUM COMMON SUBGRAPH; SPANNING TREES;

TREES (MATHEMATICS);

EID: 4544291409     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.06.019     Document Type: Article

References (13)

1. T. Akutsu, A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree, IEICE Trans. Fundamentals E76-A (1993) 1488-1493.
2. S. Arnborg, D.G. Corneil, A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. on Algebraic and Discrete Methods 8 (1987) 277-284.
3. S. Arnborg, A. Proskurowski, Linear time algorithms for NP-hard problems on graphs embedded in k-trees, Discrete Appl. Math. 23 (1989) 11-24.
4. H.L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996) 1305-1317.
5. H. Bunke, A. Kandel, Mean and maximum common subgraph of two graphs, Pattern Recognition Lett. 21 (2000) 163-168.
6. G. Ding, Graphs with not too many spanning trees, Networks 25 (1995) 193-197.
7. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
8. A. Gupta, N. Nishimura, The complexity of subgraph isomorphisms for classes of partial k-trees, Theoret. Comput. Sci. 30 (2002) 402-404.
9. S. Goto, Y. Okuno, M. Hattori, T. Nishioka, M. Kanehisa, LIGAND: database of chemical compounds and reactions in biological pathways, Nucleic Acids Res. 30 (2002) 402-404.
10. V. Kann, On the approximability of the maximum common subgraph problem, in: Proc. of 9th Ann. Symp. on Theoretical Aspects of Comput. Sci., in: Lecture Notes in Comput. Sci., vol. 577, Springer-Verlag, Berlin, 1992, pp. 377-388.
11. J. van Leeuwen, Handbook of Theoretical Computer Science, vol. A: Algorithm and Complexity, Elsevier Amsterdam, 1990.
12. J. Matoušek, R. Thomas, On the complexity of finding iso- and other morphisms for partial k-trees, Discrete Math. 108 (1992) 343-364.
13. K. Shearer, H. Bunke, S. Venkatesh, Video indexing and similarity retrieval by largest common subgraph detection using decision trees, Pattern Recog. 34 (2001) 1075-1091.