Neural Subgraph Isomorphism Counting

25 Dec 2019 Xin Liu Haojie Pan Mutian He Yangqiu Song Xin Jiang Lifeng Shang

In this paper, we study a new graph learning problem: learning to count subgraph isomorphisms. Different from other traditional graph learning problems such as node classification and link prediction, subgraph isomorphism counting is NP-complete and requires more global inference to oversee the whole graph... (read more)

PDF Abstract


  Add Datasets introduced or used in this paper

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

Memory Network
Working Memory Models