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

https://doi.org/10.1016/j.ipl.2004.06.019Get rights and content

Abstract

The maximum common subgraph problem is known to be NP-hard, although it has often been applied to various areas. In the field of molecular biology, we can reduce the problem space by analyzing the structures of chemical compounds. In doing so, we have found that the tree-width of chemical compounds are bounded by a constant, and that the possible spanning trees of any compound is polynomially bounded. We present a polynomial time algorithm for finding the maximum common connected induced subgraph of a degree-bounded partial k-tree and a connected graph, the number of whose possible spanning trees is polynomial.

References (13)

There are more references available in the full text version of this article.

Cited by (26)

  • Multi-wave tabu search for the boolean quadratic programming problem with generalized upper bound constraints

    2023, Computers and Operations Research
    Citation Excerpt :

    Hence BQP-GUB can be applied in applications of QSAP, including transit network design (Bookbinder and Désilets, 1992; Daduna and Voß, 1995), scheduling (Malucelli, 1996; Bullnheimer, 1997; Skutella, 2001), clustering (Glasner et al., 2011; Manohar et al., 2011; Duffuaa and Fedjki, 2012; Li et al., 2018) and many others. By adjusting coefficients, BQP-GUB can express the cluster-restricted maximum induced subgraph problem (MISP) and maximum clique problem (MCP), which further extends its applications to social network analysis (Pattillo et al., 2012), data mining (Cook and Holder, 2000), chemistry and biology (Raymond and Willett, 2002; Yamaguchi et al., 2004). In addition, through introducing additional variables and modifying coefficients, BQP-GUB can be recast into the unconstrained boolean quadratic programming problem (UBQP) (Lü et al., 2010; Samorani et al., 2019; Chen et al., 2020), indicating that the algorithms for UBQP can also be used to solve BQP-GUB.

  • Chemical similarity and substructure searches

    2018, Encyclopedia of Bioinformatics and Computational Biology: ABC of Bioinformatics
  • Comparison and enumeration of chemical graphs

    2013, Computational and Structural Biotechnology Journal
    Citation Excerpt :

    Trees, outerplanar graphs, and almost trees with parameter k are subclasses of partial 1-trees, partial 2-trees, and partial k+1-trees, respectively [9]. Yamaguchi et al. studied the distribution of partial k-trees in chemical graphs [10]. Horváth and Ramon also studied the distribution of partial k-trees in some dataset and reported that 8.77%, 97.35% and 99.97% of compounds are partial 1-trees, 2-trees, and 3-trees, respectively and most partial 2-tree compounds are outerplanar [11].

View all citing articles on Scopus
View full text