Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees
References (13)
- et al.
Linear time algorithms for NP-hard problems on graphs embedded in k-trees
Discrete Appl. Math.
(1989) - et al.
Mean and maximum common subgraph of two graphs
Pattern Recognition Lett.
(2000) - et al.
On the complexity of finding iso- and other morphisms for partial k-trees
Discrete Math.
(1992) - et al.
Video indexing and similarity retrieval by largest common subgraph detection using decision trees
Pattern Recog.
(2001) A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree
IEICE Trans. Fundamentals
(1993)- et al.
Complexity of finding embeddings in a k-tree
SIAM J. on Algebraic and Discrete Methods
(1987)
Cited by (26)
Multi-wave tabu search for the boolean quadratic programming problem with generalized upper bound constraints
2023, Computers and Operations ResearchCitation 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 BioinformaticsOn the complexity of various parameterizations of common induced subgraph isomorphism
2017, Theoretical Computer ScienceMaximum common induced subgraph parameterized by vertex cover
2014, Information Processing LettersComparison and enumeration of chemical graphs
2013, Computational and Structural Biotechnology JournalCitation 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].
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree
2020, International Journal of Foundations of Computer Science