{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:26:59Z","timestamp":1735583219649},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/allerton.2013.6736720","type":"proceedings-article","created":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T17:46:12Z","timestamp":1392313572000},"page":"1598-1607","source":"Crossref","is-referenced-by-count":52,"title":["A Bayesian method for matching two similar graphs without seeds"],"prefix":"10.1109","author":[{"given":"Pedram","family":"Pedarsani","sequence":"first","affiliation":[]},{"given":"Daniel R.","family":"Figueiredo","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Grossglauser","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.21"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.184"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2011.6033446"},{"key":"12","article-title":"De-anonymizing social networks. Security and privacy","author":"narayanan","year":"2009","journal-title":"IEEE Symposium on"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920988"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/34.862201"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.138"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1990","author":"garey","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.110"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/34.954602"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0210-x"}],"event":{"name":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2013,10,2]]},"location":"Monticello, IL","end":{"date-parts":[[2013,10,4]]}},"container-title":["2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6725831\/6736491\/06736720.pdf?arnumber=6736720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T13:57:31Z","timestamp":1490277451000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6736720\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/allerton.2013.6736720","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}