Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees.

Atsuko Yamaguchi Hiroshi Mamitsuka Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees. 58-67 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2906&spage=58 2003 conf/isaac/2003 ISAAC db/conf/isaac/isaac2003.html#YamaguchiM03