Login / Signup

On the complexity of finding a largest common subtree of bounded degree.

Tatsuya AkutsuTakeyuki TamuraAvraham A. MelkmanAtsuhiro Takasu
Published in: Theor. Comput. Sci. (2015)
Keyphrases
  • worst case
  • computational complexity
  • bounded treewidth
  • database
  • labeled data
  • partial order
  • graph theoretic
  • bounded degree