Login / Signup

Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial.

Magali BardetAyoub OtmaniMohamed Saeed-Taha
Published in: ISIT (2019)
Keyphrases
  • graph isomorphism
  • graph mining
  • subgraph isomorphism
  • graph search
  • np hard
  • graph data
  • np complete
  • graph databases
  • database
  • relational databases
  • data management