{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T08:12:01Z","timestamp":1782979921908,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":121,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP210101393,FT200100787, DP210101347,DP200101116,FT210100303"],"award-info":[{"award-number":["DP210101393,FT200100787, DP210101347,DP200101116,FT210100303"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1145\/3514221.3526163","type":"proceedings-article","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T02:33:49Z","timestamp":1655001229000},"page":"160-175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Neural Subgraph Counting with Wasserstein Estimator"],"prefix":"10.1145","author":[{"given":"Hanchen","family":"Wang","sequence":"first","affiliation":[{"name":"University of Technology Sydney, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2019. https:\/\/github.com\/THUDM\/ProNE."},{"key":"e_1_3_2_1_2_1","unstructured":"2020. https:\/\/github.com\/RapidsAtHKUST\/SubgraphMatching."},{"key":"e_1_3_2_1_3_1","unstructured":"2020. https:\/\/github.com\/yspark-dblab\/gcare."},{"key":"e_1_3_2_1_4_1","unstructured":"2020. https:\/\/github.com\/HKUST-KnowComp\/NeuralSubgraphCounting."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742796"},{"key":"e_1_3_2_1_7_1","volume-title":"5th International Conference on Learning Representations, ICLR","author":"Arjovsky Mart\u00edn","year":"2017","unstructured":"Mart\u00edn Arjovsky and L\u00e9on Bottou. 2017. Towards Principled Methods for Training Generative Adversarial Networks. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24--26, 2017, Conference Track Proceedings. OpenReview.net."},{"key":"e_1_3_2_1_8_1","volume-title":"CoRR abs\/1701.07875","author":"Arjovsky Mart\u00edn","year":"2017","unstructured":"Mart\u00edn Arjovsky, Soumith Chintala, and L\u00e9on Bottou. 2017. Wasserstein GAN. CoRR abs\/1701.07875 (2017)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.87"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_1_11_1","volume-title":"Graph homomorphisms and universal algebra course notes. TU Dresden","author":"Bodirsky Manuel","year":"2015","unstructured":"Manuel Bodirsky. 2015. Graph homomorphisms and universal algebra course notes. TU Dresden (2015)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018732"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342640"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319894"},{"key":"e_1_3_2_1_15_1","volume-title":"Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3","author":"Carletti Vincenzo","year":"2017","unstructured":"Vincenzo Carletti, Pasquale Foggia, Alessia Saggese, and Mario Vento. 2017. Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3. IEEE transactions on pattern analysis and machine intelligence 40, 4 (2017), 804--818."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings (Lecture Notes in Computer Science","volume":"177","author":"Carletti Vincenzo","year":"2015","unstructured":"Vincenzo Carletti, Pasquale Foggia, and Mario Vento. 2015. VF2 Plus: An Improved version of VF2 for Biological Graphs. In Graph-Based Representations in Pattern Recognition - 10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China, May 13--15, 2015. Proceedings (Lecture Notes in Computer Science, Vol. 9069), Cheng-Lin Liu, Bin Luo, Walter G. Kropatsch, and Jian Cheng (Eds.). Springer, 168--177."},{"key":"e_1_3_2_1_17_1","volume-title":"Mining graphlet counts in online social networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 12, 4","author":"Chen Xiaowei","year":"2018","unstructured":"Xiaowei Chen and John CS Lui. 2018. Mining graphlet counts in online social networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 12, 4 (2018), 1--38."},{"key":"e_1_3_2_1_18_1","volume-title":"Can graph neural networks count substructures? arXiv preprint arXiv:2002.04025","author":"Chen Zhengdao","year":"2020","unstructured":"Zhengdao Chen, Lei Chen, Soledad Villar, and Joan Bruna. 2020. Can graph neural networks count substructures? arXiv preprint arXiv:2002.04025 (2020)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_1_20_1","volume-title":"LMKG: Learned Models for Cardinality Estimation in Knowledge Graphs. arXiv preprint arXiv:2102.10588","author":"Davitkova Angjela","year":"2021","unstructured":"Angjela Davitkova, Damjan Gjurovski, and Sebastian Michel. 2021. LMKG: Learned Models for Cardinality Estimation in Knowledge Graphs. arXiv preprint arXiv:2102.10588 (2021)."},{"key":"e_1_3_2_1_21_1","volume-title":"Unsupervised Graph Alignment with Wasserstein Distance Discriminator. In 27th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery.","author":"Gao Ji","year":"2021","unstructured":"Ji Gao, Xiao Huang, and Jundong Li. 2021. Unsupervised Graph Alignment with Wasserstein Distance Discriminator. In 27th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery."},{"key":"e_1_3_2_1_22_1","volume-title":"Artificial neural networks (the multilayer perceptron)-a review of applications in the atmospheric sciences. Atmospheric environment 32, 14--15","author":"Gardner Matt W","year":"1998","unstructured":"Matt W Gardner and SR Dorling. 1998. Artificial neural networks (the multilayer perceptron)-a review of applications in the atmospheric sciences. Atmospheric environment 32, 14--15 (1998), 2627--2636."},{"key":"e_1_3_2_1_23_1","volume-title":"Johnson","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2017.08.015"},{"key":"e_1_3_2_1_25_1","volume-title":"Descriptive complexity, canonisation, and definable graph structure theory","author":"Grohe Martin","unstructured":"Martin Grohe. 2017. Descriptive complexity, canonisation, and definable graph structure theory. Vol. 47. Cambridge University Press."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems. 1025--1035","author":"Hamilton William L","year":"2017","unstructured":"William L Hamilton, Rex Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems. 1025--1035."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_1_30_1","volume-title":"KS-GNN: Keywords Search over Incomplete Graphs via Graphs Neural Network. Advances in Neural Information Processing Systems 34","author":"Hao Yu","year":"2021","unstructured":"Yu Hao, Xin Cao, Yufan Sheng, Yixiang Fang, and Wei Wang. 2021. KS-GNN: Keywords Search over Incomplete Graphs via Graphs Neural Network. Advances in Neural Information Processing Systems 34 (2021)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383049"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389741"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt717"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","first-page":"e0171428","DOI":"10.1371\/journal.pone.0171428","article-title":"Combinatorial algorithm for counting small induced graphs and orbits","volume":"12","author":"Janez","year":"2017","unstructured":"Toma? Ho?evar and Janez Dem?ar. 2017. Combinatorial algorithm for counting small induced graphs and orbits. PloS one 12, 2 (2017), e0171428.","journal-title":"PloS one"},{"key":"e_1_3_2_1_36_1","volume-title":"Privacy and efficiency guaranteed social subgraph matching. The VLDB Journal","author":"Huang Kai","year":"2021","unstructured":"Kai Huang, Haibo Hu, Shuigeng Zhou, Jihong Guan, Qingqing Ye, and Xiaofang Zhou. 2021. Privacy and efficiency guaranteed social subgraph matching. The VLDB Journal (2021), 1--22."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.02.018"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth163"},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","volume":"1","author":"Kim Duck Hoon","year":"2004","unstructured":"Duck Hoon Kim, Il Dong Yun, and Sang Uk Lee. 2004. A new attributed relational graph matching algorithm using the nested structure of earth mover's distance. In Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004., Vol. 1. IEEE, 48--51."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457265"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00010"},{"key":"e_1_3_2_1_42_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_1_43_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24--26, 2017, Conference Track Proceedings. OpenReview.net."},{"key":"e_1_3_2_1_44_1","volume-title":"On information and sufficiency. The annals of mathematical statistics 22, 1","author":"Kullback Solomon","year":"1951","unstructured":"Solomon Kullback and Richard A Leibler. 1951. On information and sufficiency. The annals of mathematical statistics 22, 1 (1951), 79--86."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794368"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021937"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_3_2_1_49_1","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Leman AA","year":"1968","unstructured":"AA Leman and B Weisfeiler. 1968. A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsiya 2, 9 (1968), 12--16.","journal-title":"Nauchno-Technicheskaya Informatsiya"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915235"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/2886444.2886453"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403247"},{"key":"e_1_3_2_1_53_1","volume-title":"Neural Subgraph Isomorphism Counting. In KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","author":"Liu Xin","year":"2020","unstructured":"Xin Liu, Haojie Pan, Mutian He, Yangqiu Song, Xin Jiang, and Lifeng Shang. 2020. Neural Subgraph Isomorphism Counting. In KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, CA, USA, August 23--27, 2020. ACM, 1959--1969."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298239.3298245"},{"key":"e_1_3_2_1_55_1","unstructured":"Zhaoyu Lou Jiaxuan You Chengtao Wen Arquimedes Canedo Jure Leskovec et al. 2020. Neural Subgraph Matching. arXiv preprint arXiv:2007.03092 (2020)."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2133841100"},{"key":"e_1_3_2_1_57_1","volume-title":"Foundations of statistical natural language processing","author":"Manning Christopher","unstructured":"Christopher Manning and Hinrich Schutze. 1999. Foundations of statistical natural language processing. MIT press."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2010.41"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.08.019"},{"key":"e_1_3_2_1_60_1","volume-title":"Matthias Minder, Giovanni Chierchia, and Pascal Frossard.","author":"Maretic Hermina Petric","year":"2020","unstructured":"Hermina Petric Maretic, Mireille El Gheche, Matthias Minder, Giovanni Chierchia, and Pascal Frossard. 2020. Wasserstein-based graph alignment. arXiv preprint arXiv:2003.06048 (2020)."},{"key":"e_1_3_2_1_61_1","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems. 2156--2167","author":"Maron Haggai","year":"2019","unstructured":"Haggai Maron, Heli Ben-Hamu, Hadar Serviansky, and Yaron Lipman. 2019. Provably Powerful Graph Networks. In Proceedings of the 33rd International Conference on Neural Information Processing Systems. 2156--2167."},{"key":"e_1_3_2_1_62_1","volume-title":"Invariant and Equivariant Graph Networks. In International Conference on Learning Representations.","author":"Maron Haggai","year":"2018","unstructured":"Haggai Maron, Heli Ben-Hamu, Nadav Shamir, and Yaron Lipman. 2018. Invariant and Equivariant Graph Networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_63_1","volume-title":"Nauty and Traces user's guide (Version 2.5). Computer Science Department","author":"McKay Brendan D","year":"2013","unstructured":"Brendan D McKay and Adolfo Piperno. 2013. Nauty and Traces user's guide (Version 2.5). Computer Science Department, Australian National University, Canberra, Australia (2013)."},{"key":"e_1_3_2_1_64_1","volume-title":"Network motifs: simple building blocks of complex networks. Science 298, 5594","author":"Milo Ron","year":"2002","unstructured":"Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: simple building blocks of complex networks. Science 298, 5594 (2002), 824--827."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687738"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687738"},{"key":"e_1_3_2_1_67_1","volume-title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings. Advances in Neural Information Processing Systems 33","author":"Morris Christopher","year":"2020","unstructured":"Christopher Morris, Gaurav Rattan, and Petra Mutzel. 2020. Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings. Advances in Neural Information Processing Systems 33 (2020)."},{"key":"e_1_3_2_1_68_1","unstructured":"Vinod Nair and Geoffrey E Hinton. 2010. Rectified linear units improve restricted boltzmann machines. In Icml."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196990"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298483.3298589"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28361-6_1"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389702"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467344"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl030"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297929"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3433652"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0968-2"},{"key":"e_1_3_2_1_80_1","volume-title":"Finding network motifs using MCMC sampling","author":"Saha Tanay Kumar","unstructured":"Tanay Kumar Saha and Mohammad Al Hasan. 2015. Finding network motifs using MCMC sampling. In Complex Networks VI. Springer, 13--24."},{"key":"e_1_3_2_1_81_1","volume-title":"A survey on the expressive power of graph neural networks. arXiv preprint arXiv:2003.04078","author":"Sato Ryoma","year":"2020","unstructured":"Ryoma Sato. 2020. A survey on the expressive power of graph neural networks. arXiv preprint arXiv:2003.04078 (2020)."},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.2"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308560.3320092"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_2_1_85_1","unstructured":"Nino Shervashidze SVN Vishwanathan Tobias Petri Kurt Mehlhorn and Karsten Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In Artificial intelligence and statistics. PMLR 488--495."},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186003"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368296"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452790"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2009.0029"},{"key":"e_1_3_2_1_91_1","volume-title":"Graph Attention Networks. In 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenReview.net.","author":"Velickovic Petar","year":"2018","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph Attention Networks. In 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenReview.net."},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824051"},{"key":"e_1_3_2_1_93_1","volume-title":"Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020","author":"Vignac Cl\u00e9ment","year":"2020","unstructured":"Cl\u00e9ment Vignac, Andreas Loukas, and Pascal Frossard. 2020. Building powerful and equivariant graph neural networks with structural message-passing. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6--12, 2020, virtual, Hugo Larochelle, Marc'Aurelio Ranzato, Raia Hadsell, Maria-Florina Balcan, and Hsuan-Tien Lin (Eds.)."},{"key":"e_1_3_2_1_94_1","volume-title":"Optimal transport: old and new","author":"Villani C\u00e9dric","unstructured":"C\u00e9dric Villani. 2009. Optimal transport: old and new. Vol. 338. Springer."},{"key":"e_1_3_2_1_95_1","volume-title":"Powerful graph of graphs neural network for structured entity analysis. World Wide Web","author":"Wang Hanchen","year":"2021","unstructured":"Hanchen Wang, Defu Lian, Wanqi Liu, Dong Wen, Chen Chen, and Xiaoyang Wang. 2021. Powerful graph of graphs neural network for structured entity analysis. World Wide Web (2021), 1--21."},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00878-3"},{"key":"e_1_3_2_1_97_1","volume-title":"Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence. 1317--1323","author":"Wang Hanchen","year":"2021","unstructured":"Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, and Xuemin Lin. 2021. GoGNN: graph of graphs neural network for predicting structured entity interactions. In Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence. 1317--1323."},{"key":"e_1_3_2_1_98_1","volume-title":"Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching. arXiv preprint arXiv:2201.11251","author":"Wang Hanchen","year":"2022","unstructured":"Hanchen Wang, Ying Zhang, Lu Qin, Wei Wang, Wenjie Zhang, and Xuemin Lin. 2022. Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching. arXiv preprint arXiv:2201.11251 (2022)."},{"key":"e_1_3_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2012.119"},{"key":"e_1_3_2_1_100_1","volume-title":"Bruno Ribeiro, Don Towsley, Junzhou Zhao, and Xiaohong Guan.","author":"Wang Pinghui","year":"2014","unstructured":"Pinghui Wang, John CS Lui, Bruno Ribeiro, Don Towsley, Junzhou Zhao, and Xiaohong Guan. 2014. Efficiently estimating motif statistics of large networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 9, 2 (2014), 1--27."},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2756836"},{"key":"e_1_3_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452772"},{"key":"e_1_3_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452830"},{"key":"e_1_3_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_1_105_1","volume-title":"BayesCard: Revitilizing Bayesian Frameworks for Cardinality Estimation. arXiv preprint arXiv:2012.14743","author":"Wu Ziniu","year":"2020","unstructured":"Ziniu Wu, Amir Shaikhha, Rong Zhu, Kai Zeng, Yuxing Han, and Jingren Zhou. 2020. BayesCard: Revitilizing Bayesian Frameworks for Cardinality Estimation. arXiv preprint arXiv:2012.14743 (2020)."},{"key":"e_1_3_2_1_106_1","volume-title":"Scalable Gromov-Wasserstein learning for graph partitioning and matching. Advances in neural information processing systems 32","author":"Xu Hongteng","year":"2019","unstructured":"Hongteng Xu, Dixin Luo, and Lawrence Carin. 2019. Scalable Gromov-Wasserstein learning for graph partitioning and matching. Advances in neural information processing systems 32 (2019), 3052--3062."},{"key":"e_1_3_2_1_107_1","volume-title":"International conference on machine learning. PMLR, 6932--6941","author":"Xu Hongteng","year":"2019","unstructured":"Hongteng Xu, Dixin Luo, Hongyuan Zha, and Lawrence Carin Duke. 2019. Gromov-wasserstein learning for graph matching and node embedding. In International conference on machine learning. PMLR, 6932--6941."},{"key":"e_1_3_2_1_108_1","volume-title":"International Conference on Learning Representations.","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How Powerful are Graph Neural Networks?. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421432"},{"key":"e_1_3_2_1_110_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457237"},{"key":"e_1_3_2_1_111_1","volume-title":"Proceedings of the VLDB Endowment 13","author":"Yang Zongheng","unstructured":"]yang13deep Zongheng Yang, Eric Liang, Amog Kamsetty, Chenggang Wu, Yan Duan, Xi Chen, Pieter Abbeel, Joseph M Hellerstein, Sanjay Krishnan, and Ion Stoica. [n. d.]. Deep Unsupervised Cardinality Estimation. Proceedings of the VLDB Endowment 13, 3 ([n. d.])."},{"key":"e_1_3_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330961"},{"key":"e_1_3_2_1_113_1","first-page":"4278","article-title":"ProNE: Fast and Scalable Network Representation Learning","volume":"19","author":"Zhang Jie","year":"2019","unstructured":"Jie Zhang, Yuxiao Dong, Yan Wang, Jie Tang, and Ming Ding. 2019. ProNE: Fast and Scalable Network Representation Learning.. In IJCAI, Vol. 19. 4278--4284.","journal-title":"IJCAI"},{"key":"e_1_3_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.249"},{"key":"e_1_3_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2223226"},{"key":"e_1_3_2_1_116_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516384"},{"key":"e_1_3_2_1_117_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457289"},{"key":"e_1_3_2_1_118_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"e_1_3_2_1_119_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183739"},{"key":"e_1_3_2_1_120_1","volume-title":"Can Graph Neural Networks Count Substructures? Advances in neural information processing systems","author":"Zhengdao Chen","year":"2020","unstructured":"Chen Zhengdao, Chen Lei, Villar Soledad, and Joan Bruna. 2020. Can Graph Neural Networks Count Substructures? Advances in neural information processing systems (2020)."},{"key":"e_1_3_2_1_121_1","volume-title":"Structural comparison of metabolic networks in selected single cell organisms. BMC bioinformatics 6, 1","author":"Zhu Dongxiao","year":"2005","unstructured":"Dongxiao Zhu and Zhaohui S Qin. 2005. Structural comparison of metabolic networks in selected single cell organisms. BMC bioinformatics 6, 1 (2005), 1--12."}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3526163","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3526163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:13Z","timestamp":1750183813000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3526163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":121,"alternative-id":["10.1145\/3514221.3526163","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3526163","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"2022-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}