{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:22Z","timestamp":1750220542800,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Research Grants Council of Hong Kong, China","award":["No. 14203618, No. 14202919, No. 14205520, No. 14205617 and No. 14205618"],"award-info":[{"award-number":["No. 14203618, No. 14202919, No. 14205520, No. 14205617 and No. 14205618"]}]},{"name":"NSFC","award":["No. U1936205, No. 62072035"],"award-info":[{"award-number":["No. U1936205, No. 62072035"]}]},{"name":"Hong Kong GRF","award":["No.12201518"],"award-info":[{"award-number":["No.12201518"]}]},{"name":"Open Research Projects of Zhejiang Lab","award":["No. 2020KE0AB04"],"award-info":[{"award-number":["No. 2020KE0AB04"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3452820","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"1195-1207","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Graph Iso\/Auto-morphism"],"prefix":"10.1145","author":[{"given":"Can","family":"Lu","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035924"},{"key":"e_1_3_2_2_2_1","volume-title":"Dagstuhl Reports","volume":"5","author":"Babai L.","year":"2016","unstructured":"L. Babai , A. Dawar , P. Schweitzer , and J. Tor\u00e1n . The graph isomorphism problem (dagstuhl seminar 15511) . In Dagstuhl Reports , volume 5 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik , 2016 . L. Babai, A. Dawar, P. Schweitzer, and J. Tor\u00e1n. The graph isomorphism problem (dagstuhl seminar 15511). In Dagstuhl Reports, volume 5. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.10"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.8"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808746"},{"key":"e_1_3_2_2_6_1","volume-title":"Emergence of scaling in random networks. Science, 286(5439)","author":"Barab\u00e1si A.-L.","year":"1999","unstructured":"A.-L. Barab\u00e1si and R. Albert . Emergence of scaling in random networks. Science, 286(5439) , 1999 . A.-L. Barab\u00e1si and R. Albert. Emergence of scaling in random networks. Science, 286(5439), 1999."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90013-5"},{"key":"e_1_3_2_2_8_1","volume-title":"Chemical graph theory: introduction and fundamentals","author":"Bonchev D.","year":"1991","unstructured":"D. Bonchev . Chemical graph theory: introduction and fundamentals , volume 1 . CRC Press , 1991 . D. Bonchev. Chemical graph theory: introduction and fundamentals, volume 1. CRC Press, 1991."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_2_12_1","volume-title":"arXiv preprint arXiv:0909.4692","author":"Dorn F.","year":"2009","unstructured":"F. Dorn . Planar subgraph isomorphism revisited. arXiv preprint arXiv:0909.4692 , 2009 . F. Dorn. Planar subgraph isomorphism revisited. arXiv preprint arXiv:0909.4692, 2009."},{"key":"e_1_3_2_2_13_1","first-page":"6","article-title":"On random graphs i","author":"Erd\u00f6s P.","year":"1959","unstructured":"P. Erd\u00f6s and A. R\u00e9nyi . On random graphs i . Publ. Math. Debrecen , 6 , 1959 . P. Erd\u00f6s and A. R\u00e9nyi. On random graphs i. Publ. Math. Debrecen, 6, 1959.","journal-title":"Publ. Math. Debrecen"},{"key":"e_1_3_2_2_14_1","volume-title":"The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems (TOPLAS), 9(3)","author":"Ferrante J.","year":"1987","unstructured":"J. Ferrante , K. J. Ottenstein , and J. D. Warren . The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems (TOPLAS), 9(3) , 1987 . J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems (TOPLAS), 9(3), 1987."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804671"},{"key":"e_1_3_2_2_16_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979."},{"key":"e_1_3_2_2_17_1","volume-title":"Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems. JACM, 38(3)","author":"Goldreich O.","year":"1991","unstructured":"O. Goldreich , S. Micali , and A. Wigderson . Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems. JACM, 38(3) , 1991 . O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems. JACM, 38(3), 1991."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/120892234"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.66"},{"key":"e_1_3_2_2_20_1","volume-title":"Gap system for computational discrete algebra","author":"G. Group et al.","year":"2007","unstructured":"G. Group et al. Gap system for computational discrete algebra , 2007 . G. Group et al. Gap system for computational discrete algebra, 2007."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.13"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987334.1987350"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/567532.567555"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_2_28_1","volume-title":"Sosivc . Snap: A general-purpose network analysis and graph-mining library. ACM Transactions on Intelligent Systems and Technology (TIST), 8(1):1","author":"Leskovec J.","year":"2016","unstructured":"J. Leskovec and R. Sosivc . Snap: A general-purpose network analysis and graph-mining library. ACM Transactions on Intelligent Systems and Technology (TIST), 8(1):1 , 2016 . J. Leskovec and R. Sosivc . Snap: A general-purpose network analysis and graph-mining library. ACM Transactions on Intelligent Systems and Technology (TIST), 8(1):1, 2016."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129750"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150522"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137660"},{"key":"e_1_3_2_2_32_1","volume-title":"Journal of computer and system sciences, 25(1)","author":"Luks E. M.","year":"1982","unstructured":"E. M. Luks . Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of computer and system sciences, 25(1) , 1982 . E. M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of computer and system sciences, 25(1), 1982."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0062536"},{"key":"e_1_3_2_2_34_1","volume-title":"Practical graph isomorphism","author":"McKay B. D.","year":"1981","unstructured":"B. D. McKay Practical graph isomorphism . 1981 . B. D. McKay et al. Practical graph isomorphism. 1981."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804670"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"e_1_3_2_2_37_1","first-page":"24","article-title":"Community detection in social media","author":"Papadopoulos S.","year":"2012","unstructured":"S. Papadopoulos , Y. Kompatsiaris , A. Vakali , and P. Spyridonos . Community detection in social media . Data Mining and Knowledge Discovery , 24 , 2012 . S. Papadopoulos, Y. Kompatsiaris, A. Vakali, and P. Spyridonos. Community detection in social media. Data Mining and Knowledge Discovery, 24, 2012.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"e_1_3_2_2_38_1","volume-title":"arXiv preprint arXiv:0804.4881","author":"Piperno A.","year":"2008","unstructured":"A. Piperno . Search space contraction in canonical labeling of graphs. arXiv preprint arXiv:0804.4881 , 2008 . A. Piperno. Search space contraction in canonical labeling of graphs. arXiv preprint arXiv:0804.4881, 2008."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci00029a011"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010410"},{"issue":"9","key":"e_1_3_2_2_41_1","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"Shervashidze N.","year":"2011","unstructured":"N. Shervashidze , P. Schweitzer , E. J. Van Leeuwen , K. Mehlhorn , and K. M. Borgwardt . Weisfeiler-lehman graph kernels . Journal of Machine Learning Research , 12 ( 9 ), 2011 . N. Shervashidze, P. Schweitzer, E. J. Van Leeuwen, K. Mehlhorn, and K. M. Borgwardt. Weisfeiler-lehman graph kernels. Journal of Machine Learning Research, 12(9), 2011.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_42_1","volume-title":"An algorithm for subgraph isomorphism. Journal of the ACM (JACM), 23(1):31--42","author":"Ullmann J. R.","year":"1976","unstructured":"J. R. Ullmann . An algorithm for subgraph isomorphism. Journal of the ACM (JACM), 23(1):31--42 , 1976 . J. R. Ullmann. An algorithm for subgraph isomorphism. Journal of the ACM (JACM), 23(1):31--42, 1976."},{"key":"e_1_3_2_2_43_1","volume-title":"Collective dynamics of small-world networks. Nature, 393(6684)","author":"Watts D. J.","year":"1998","unstructured":"D. J. Watts and S. H. Strogatz . Collective dynamics of small-world networks. Nature, 393(6684) , 1998 . D. J. Watts and S. H. Strogatz. Collective dynamics of small-world networks. Nature, 393(6684), 1998."},{"key":"e_1_3_2_2_44_1","volume-title":"On construction and identification of graphs","author":"Weisfeiler B.","year":"2006","unstructured":"B. Weisfeiler . On construction and identification of graphs , volume 558 . Springer , 2006 . B. Weisfeiler. On construction and identification of graphs, volume 558. Springer, 2006."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739058"},{"key":"e_1_3_2_2_46_1","first-page":"101","article-title":"Network motifs in integrated cellular networks of transcription--regulation and protein--protein interaction","author":"Yeger-Lotem E.","year":"2004","unstructured":"E. Yeger-Lotem , S. Sattath , N. Kashtan , S. Itzkovitz , R. Milo , R. Y. Pinter , U. Alon , and H. Margalit . Network motifs in integrated cellular networks of transcription--regulation and protein--protein interaction . PNAS , 101 , 2004 . E. Yeger-Lotem, S. Sattath, N. Kashtan, S. Itzkovitz, R. Milo, R. Y. Pinter, U. Alon, and H. Margalit. Network motifs in integrated cellular networks of transcription--regulation and protein--protein interaction. PNAS, 101, 2004.","journal-title":"PNAS"},{"key":"e_1_3_2_2_47_1","volume-title":"Large cliques in arabidopsis gene coexpression network and motif discovery. Journal of plant physiology, 168","author":"Zheng X.","year":"2011","unstructured":"X. Zheng , T. Liu , Z. Yang , and J. Wang . Large cliques in arabidopsis gene coexpression network and motif discovery. Journal of plant physiology, 168 , 2011 . X. Zheng, T. Liu, Z. Yang, and J. Wang. Large cliques in arabidopsis gene coexpression network and motif discovery. Journal of plant physiology, 168, 2011."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Virtual Event China","acronym":"SIGMOD\/PODS '21"},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452820","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3452820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:05Z","timestamp":1750195685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452820"}},"subtitle":["A Divide-&-Conquer Approach"],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":47,"alternative-id":["10.1145\/3448016.3452820","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3452820","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}