Login / Signup

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

Tatsuya AkutsuTakeyuki Tamura
Published in: ISAAC (2012)
Keyphrases
  • bounded degree
  • maximum common subgraph
  • graph theoretic
  • bounded treewidth
  • databases
  • search space
  • decision problems
  • social networks