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

Authors:
Atsuko Yamaguchi;Kiyoko F. Aoki;Hiroshi Mamitsuka
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, 611-0011, Japan;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, 611-0011, Japan;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, 611-0011, Japan
Venue:
Information Processing Letters
Year:
2004

Citing 8
Cited 3

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Linear time algorithms for NP-hard problems restricted to partial k-trees

Discrete Applied Mathematics
On the complexity of finding iso- and other morphisms for partial k-trees

Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Mean and maximum common subgraph of two graphs

Pattern Recognition Letters
Handbook of Theoretical Computer Science

Handbook of Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Approximability of the Maximum Common Subgraph Problem

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science

A new approach and faster exact methods for the maximum common subgraph problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Maximum common induced subgraph parameterized by vertex cover

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

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.