Login / Signup

On Tractable Parameterizations of Graph Isomorphism.

Adam BoulandAnuj DawarEryk Kopczynski
Published in: IPEC (2012)
Keyphrases
  • graph isomorphism
  • np complete
  • conp complete
  • graph search
  • graph mining
  • graph data
  • subgraph isomorphism
  • computational complexity
  • np hard
  • pairwise
  • relational databases
  • data mining
  • special case