{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:21Z","timestamp":1772164101906,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:00:00Z","timestamp":1622419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF Grant","award":["IIS-1932630"],"award-info":[{"award-number":["IIS-1932630"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,5,31]]},"DOI":"10.1145\/3410220.3460098","type":"proceedings-article","created":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T06:11:02Z","timestamp":1622959862000},"page":"77-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["The Power of D-hops in Matching Power-Law Graphs"],"prefix":"10.1145","author":[{"given":"Liren","family":"Yu","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"given":"Jiaming","family":"Xu","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}]},{"given":"Xiaojun","family":"Lin","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. In European Symposium on Algorithms. Springer, 197--208","author":"Bringmann Karl","year":"2014","unstructured":"Karl Bringmann, Tobias Friedrich, and Anton Krohmer. 2014. De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. In European Symposium on Algorithms. Springer, 197--208."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2553843"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129081"},{"key":"e_1_3_2_2_4_1","volume-title":"Priebe","author":"Fishkind Donniell E.","year":"2018","unstructured":"Donniell E. Fishkind, Sancar Adali, Heather G. Patsolic, Lingyao Meng, Digvijay Singh, Vince Lyzinski, and Carey E. Priebe. 2018. Seeded Graph Matching. arxiv: 1209.0367 [stat.ML]"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794371"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"e_1_3_2_2_7_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data ."},{"key":"e_1_3_2_2_8_1","volume-title":"Correcting the Output of Approximate Graph Matching Algorithms. In IEEE INFOCOM 2018-IEEE Conference on Computer Communications. IEEE, 1745--1753","author":"Lubars Joseph","year":"2018","unstructured":"Joseph Lubars and R Srikant. 2018. Correcting the Output of Approximate Graph Matching Algorithms. In IEEE INFOCOM 2018-IEEE Conference on Computer Communications. IEEE, 1745--1753."},{"key":"e_1_3_2_2_9_1","article-title":"Seeded Graph Matching for Correlated Erdos-R\u00e9nyi Graphs","volume":"15","author":"Lyzinski Vince","year":"2013","unstructured":"Vince Lyzinski, Donniell E. Fishkind, and Carey E. Priebe. 2013. Seeded Graph Matching for Correlated Erdos-R\u00e9nyi Graphs. Journal of Machine Learning Research, Vol. 15 (2013).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.62"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"e_1_3_2_2_12_1","volume-title":"Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees. In 2017 51st Asilomar Conference on Signals, Systems, and Computers. IEEE, 253--257","author":"Shirani Farhad","year":"2017","unstructured":"Farhad Shirani, Siddharth Garg, and Elza Erkip. 2017. Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees. In 2017 51st Asilomar Conference on Signals, Systems, and Computers. IEEE, 253--257."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"e_1_3_2_2_14_1","volume-title":"2021 a. Graph Matching with Partially-Correct Seeds. arxiv","author":"Yu Liren","year":"2004","unstructured":"Liren Yu, Jiaming Xu, and Xiaojun Lin. 2021 a. Graph Matching with Partially-Correct Seeds. arxiv: 2004.03816 [cs.DS]"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3410220.3460098"}],"event":{"name":"SIGMETRICS '21: ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems","location":"Virtual Event China","acronym":"SIGMETRICS '21","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Abstract Proceedings of the 2021 ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3410220.3460098","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3410220.3460098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:40:59Z","timestamp":1750185659000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3410220.3460098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,31]]},"references-count":15,"alternative-id":["10.1145\/3410220.3460098","10.1145\/3410220"],"URL":"https:\/\/doi.org\/10.1145\/3410220.3460098","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3543516.3460098","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2021,5,31]]},"assertion":[{"value":"2021-06-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}