Login / Signup

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

Julian DörflerMarc RothJohannes SchmittPhilip Wellnitz
Published in: MFCS (2019)
Keyphrases
  • computational complexity
  • learning theory
  • data structure
  • graph mining
  • graph databases
  • databases
  • np hard
  • np complete
  • information theoretic
  • phase transition
  • subgraph mining
  • decision trees