• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree.

Tatsuya AkutsuAvraham A. MelkmanTakeyuki Tamura
Published in: Int. J. Found. Comput. Sci. (2020)
Keyphrases
  • bounded treewidth
  • np complete
  • bounded degree
  • decision problems
  • np hard
  • machine learning
  • state space
  • application domains
  • regular expressions