{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T16:31:07Z","timestamp":1790440267464,"version":"4.1.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/acssc.2017.8335178","type":"proceedings-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T22:21:42Z","timestamp":1524090102000},"page":"253-257","source":"Crossref","is-referenced-by-count":39,"title":["Seeded graph matching: Efficient algorithms and theoretical guarantees"],"prefix":"10.1109","author":[{"given":"Farhad","family":"Shirani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siddharth","family":"Garg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elza","family":"Erkip","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/2964791.2901460","article-title":"Improved achievability and converse bounds for Erdos-Renyi graph matching","volume":"44","author":"cullina","year":"2016","journal-title":"SIGMETRICS Perform Eval Rev"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7446983"},{"key":"ref12","first-page":"17","volume":"5","author":"erdos","year":"1960","journal-title":"Random Graphs i Publ Math Inst Hungar Acad Sci"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02392023","article-title":"Graphs on unlabelled nodes with a given number of edges","volume":"126","author":"edward m","year":"1971","journal-title":"Acta Mathematica"},{"key":"ref14","author":"kazemi","year":"2016","journal-title":"Network alignment Theory algorithms and applications"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736720"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660278"},{"key":"ref18","author":"fu","year":"2017","journal-title":"De-anonymization of social networks with communities When quantifications meet algorithms"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262775"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2007.01.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0209025"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2553843"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794371"},{"key":"ref8","first-page":"127","article-title":"Robust multimodal graph matching: Sparse coding meets graph matching","author":"fiori","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref7","first-page":"3513","article-title":"Seeded graph matching for correlated Erdös-Rényi graphs","volume":"15","author":"lyzinski","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0209047"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869137"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2529591"},{"key":"ref21","author":"shirani","year":"2017","journal-title":"Seeded graph matching Efficient algorithms and theoretical guarantees"}],"event":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","location":"Pacific Grove, CA, USA","start":{"date-parts":[[2017,10,29]]},"end":{"date-parts":[[2017,11,1]]}},"container-title":["2017 51st Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8330843\/8335116\/08335178.pdf?arnumber=8335178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T06:16:06Z","timestamp":1643177766000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8335178\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/acssc.2017.8335178","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}