Login / Signup

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness.

Julian DörflerMarc RothJohannes SchmittPhilip Wellnitz
Published in: Algorithmica (2022)
Keyphrases
  • data structure
  • computational complexity
  • information theoretic
  • learning theory
  • graph mining
  • np hard
  • np complete
  • phase transition
  • relational databases
  • frequent subgraph mining