Fetching the paper…
Reading the bibliography…
Subgraph isomorphism counting is an important problem on graphs, as many graph-based tasks exploit recurring subgraph patterns.
Neural subgraph isomorphism counting
Liu, X.; Pan, H.; He, M.; Song, Y.; Jiang, X.; and Shang, L. 2020 · 1969
Earlier work this paper cites.
An algorithm for subgraph isomorphism
Ullmann, J. R. 1976 · 1976
Earlier work this paper cites.
Color-coding
Alon, N.; Yuster, R.; and Zwick, U. 1995 · 1995
Earlier work this paper cites.
Gradient-based learning applied to document recognition
LeCun, Y.; Bottou, L.; Bengio, Y.; and Haffner, P. 1998 · 1998
Earlier work this paper cites.
Network motifs: simple building blocks of complex networks
Milo, R.; Shen-Orr, S.; Itzkovitz, S.; Kashtan, N.; Chklovskii, D.; and Alon, U. 2002 · 2002
Earlier work this paper cites.
A (sub) graph isomorphism algorithm for matching large graphs
Cordella, L. P.; Foggia, P.; Sansone, C.; and Vento, M. 2004 · 2004
Earlier work this paper cites.
Graph indexing: A frequent structure-based approach
Yan, X.; Yu, P. S.; and Han, J. 2004 · 2004
Earlier work this paper cites.
Open Graph Benchmark: Datasets for Machine Learning on Graphs
Hu, W.; Fey, M.; Zitnik, M.; Dong, Y.; Ren, H.; Liu, B.; Catasta, M.; and Leskovec, J. 2020 · 2005
Earlier work this paper cites.
Graphs-at-a-time: query language and access methods for graph databases
He, H.; and Singh, A. K. 2008 · 2008
Earlier work this paper cites.
PathSim: Meta path-based top-k similarity search in heterogeneous information networks
Sun, Y.; Han, J.; Yan, X.; Yu, P. S.; and Wu, T. 2011 · 2011
Earlier work this paper cites.
RAGE–a rapid graphlet enumerator for large networks
Marcus, D.; and Shavitt, Y. 2012 · 2012
Earlier work this paper cites.
Teixeira, C. H.; Kakodkar, M.; Dias, V.; Meira Jr, W.; and Ribeiro, B. 2020 · 2012
Earlier work this paper cites.
Symmetry compression method for discovering network motifs
Wang, J.; Huang, Y.; Wu, F.-X.; and Pan, Y. 2012 · 2012
Earlier work this paper cites.
Turbo iso {}_{\text{iso}} : towards ultrafast and robust subgraph isomorphism search in large graph databases
Han, W.-S.; Lee, J.; and Lee, J.-H. 2013 · 2013
Earlier work this paper cites.
Empirical evaluation of gated recurrent neural networks on sequence modeling
Chung, J.; Gulcehre, C.; Cho, K.; and Bengio, Y. 2014 · 2014
Earlier work this paper cites.
A combinatorial approach to graphlet counting
Hočevar, T.; and Demšar, J. 2014 · 2014
Earlier work this paper cites.
acc-Motif: Accelerated network motif detection
Meira, L. A.; Máximo, V. R.; Fazenda, Á. L.; and Da Conceiçao, A. F. 2014 · 2014
Earlier work this paper cites.
Efficiently estimating motif statistics of large networks
Wang, P.; Lui, J. C.; Ribeiro, B.; Towsley, D.; Zhao, J.; and Guan, X. 2014 · 2014
Earlier work this paper cites.
Efficient graphlet counting for large networks
Ahmed, N. K.; Neville, J.; Rossi, R. A.; and Duffield, N. 2015 · 2015
Cited alongside, same era.
Semantic proximity search on graphs with metagraph-based learning
Fang, Y.; Lin, W.; Zheng, V. W.; Wu, M.; Chang, K. C.-C.; and Li, X.-L. 2016 · 2016
Cited alongside, same era.
Deep residual learning for image recognition
He, K.; Zhang, X.; Ren, S.; and Sun, J. 2016 · 2016
Cited alongside, same era.
Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3
Carletti, V.; Foggia, P.; Saggese, A.; and Vento, M. 2017 · 2017
Cited alongside, same era.
Hypernetworks
Ha, D.; Dai, A.; and Le, Q. V. 2017 · 2017
Cited alongside, same era.
Inductive representation learning on large graphs
Hamilton, W.; Ying, Z.; and Leskovec, J. 2017 · 2017
Cited alongside, same era.
Exploiting edge features for graph neural networks
Gong, L.; and Cheng, Q. 2019 · 2019
Later among the works it cites.
Self-attention graph pooling
Lee, J.; Lee, I.; and Kang, J. 2019 · 2019
Later among the works it cites.
Meta-GNN: metagraph neural network for semi-supervised learning in attributed heterogeneous information networks
Sankar, A.; Zhang, X.; and Chang, K. C.-C. 2019 · 2019
Later among the works it cites.
How powerful are graph neural networks?
Xu, K.; Hu, W.; Leskovec, J.; and Jegelka, S. 2019 · 2019
Later among the works it cites.
Peregrine: a pattern-aware graph mining system
Jamshidi, K.; Mahadasa, R.; and Vora, K. 2020 · 2020
Later among the works it cites.
Co-embedding of nodes and edges with graph neural networks
Jiang, X.; Zhu, R.; Li, S.; and Ji, P. 2020 · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Impact of memory space optimization technique on fast network motif search algorithm
Jain, S.; et al. 2017 · 2017
Cited alongside, same era.
Semi-supervised classification with graph convolutional networks
Kipf, T. N.; and Welling, M. 2017 · 2017
Cited alongside, same era.
Escape: Efficiently counting all 5-vertex subgraphs
Pinar, A.; Seshadhri, C.; and Vishal, V. 2017 · 2017
Cited alongside, same era.
Subgraph-augmented path embedding for semantic user search on heterogeneous social network
Liu, Z.; Zheng, V. W.; Zhao, Z.; Yang, H.; Chang, K. C.-C.; Wu, M.; and Ying, J. 2018 · 2018
Cited alongside, same era.
MotifNet: a motif-based graph convolutional network for directed graphs
Monti, F.; Otness, K.; and Bronstein, M. M. 2018 · 2018
Cited alongside, same era.
Dual-primal graph convolutional networks
Monti, F.; Shchur, O.; Bojchevski, A.; Litany, O.; Günnemann, S.; and Bronstein, M. M. 2018 · 2018
Cited alongside, same era.
A comprehensive survey on graph neural networks
Wu, Z.; Pan, S.; Chen, F.; Long, G.; Zhang, C.; and Philip, S. Y. 2020 · 2020
Later among the works it cites.
Nenn: Incorporate node and edge features in graph neural networks
Yang, Y.; and Li, D. 2020 · 2020
Later among the works it cites.
Graph few-shot learning via knowledge transfer
Yao, H.; Zhang, C.; Wei, Y.; Jiang, M.; Wang, S.; Huang, J.; Chawla, N.; and Li, Z. 2020 · 2020
Later among the works it cites.
Can Graph Neural Networks Count Substructures?
Zhengdao, C.; Lei, C.; Soledad, V.; and Bruna, J. 2020 · 2020
Later among the works it cites.
Faster motif counting via succinct color coding and adaptive sampling
Bressan, M.; Leucci, S.; and Panconesi, A. 2021 · 2021
Later among the works it cites.
EdgeNets: Edge varying graph neural networks
Isufi, E.; Gama, F.; and Ribeiro, A. 2021 · 2021
Later among the works it cites.
Node-wise Localization of Graph Neural Networks
Liu, Z.; Fang, Y.; Liu, C.; and Hoi, S. C. 2021 · 2021
Later among the works it cites.
Tail-GNN: Tail-node graph neural networks
Liu, Z.; Nguyen, T.-K.; and Fang, Y. 2021 · 2021
Later among the works it cites.
A Learned Sketch for Subgraph Counting
Zhao, K.; Yu, J. X.; Zhang, H.; Li, Q.; and Rong, Y. 2021 · 2021
Later among the works it cites.
Graph convolutional networks with dual message passing for subgraph isomorphism counting and matching
Liu, X.; and Song, Y. 2022 · 2022
Later among the works it cites.
On the substructure countability of graph neural networks
Xia, W.; Li, Y.; and Li, S. 2022 · 2022
Later among the works it cites.
Heterogeneous graph attention network
Wang, X.; Ji, H.; Shi, C.; Wang, B.; Ye, Y.; Cui, P.; and Yu, P. S. 2019 · 2032
Closest in time.