Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees
type: Item
instance of: scholarly article
title: Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees
zbMATH Open document ID: 1173.68533
author: Atsuko Yamaguchi
author: Kiyoko F. Aoki
author: Hiroshi Mamitsuka
published in: Information Processing Letters
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5599133
zbMATH Keywords: computational complexity
zbMATH Keywords: graph algorithms
zbMATH Keywords: maximum common subgraph
Wikidata QID: Q57010789
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.06.019
OpenAlex ID: W1999414674
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Graphs with not too many spanning trees
cites work: Q4198056
cites work: On the approximability of the maximum common subgraph problem
cites work: Q3998976
cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees
cites work: Video indexing and similarity retrieval by largest common subgraph detection using decision trees
DOI: 10.1016/J.IPL.2004.06.019
description: scientific article; zbMATH DE number 5599133