Skip to content

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

VenueBISAAC
Year2003
ProceedingsISAAC

Browse the full ISAAC paper archive.