On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree.

Tatsuya Akutsu, Takeyuki Tamura

Browse the full ISAAC paper archive.