{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T20:29:52Z","timestamp":1775420992792,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"NIH","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DoD"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2016,1,1]]},"DOI":"10.1109\/tpami.2015.2424894","type":"journal-article","created":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T18:51:52Z","timestamp":1429642312000},"page":"60-73","source":"Crossref","is-referenced-by-count":92,"title":["Graph Matching: Relax at Your Own Risk"],"prefix":"10.1109","volume":"38","author":[{"given":"Vince","family":"Lyzinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donniell E.","family":"Fishkind","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcelo","family":"Fiori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua T.","family":"Vogelstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carey E.","family":"Priebe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"Sapiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/MPUL.2011.2181023"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"ref32","author":"bazaraa","year":"2013","journal-title":"Nonlinear Programming Theory and Algorithms"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129115"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10054"},{"key":"ref37","first-page":"22","article-title":"Spectral clustering for divide-and-conquer graph matching","volume":"1050","author":"lyzinski","year":"2014","journal-title":"Stat"},{"key":"ref36","first-page":"127","article-title":"Robust multimodal graph matching: Sparse coding meets graph matching","author":"fiori","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008293323270"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.146"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","article-title":"Internet: Diameter of the world-wide web","volume":"401","author":"albert","year":"1999","journal-title":"Nature"},{"key":"ref11","first-page":"1","volume":"4","author":"ullman","year":"1974","journal-title":"The Design and Analysis of Computer Algorithms"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803896"},{"key":"ref13","article-title":"On spectral properties for graph matching and graph isomorphism problems","author":"sapiro","year":"2015"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1401651112"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588795"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref17","article-title":"Fast approximate quadratic programming for graph matching","author":"vogelstein","year":"2012"},{"key":"ref18","article-title":"Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs","author":"wright","year":"2014","journal-title":"arXiv 1401 2436"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/120867834"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref4","first-page":"398","article-title":"Progressive graph matching: Making a move of graphs via probabilistic voting","author":"cho","year":"0","journal-title":"Proc IEEE Conf Comput Vision Pattern Recog"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001412500139"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2009.01.004"},{"key":"ref6","first-page":"896","article-title":"Graph matching for shape retrieval","author":"huet","year":"1999","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF02773639"},{"key":"ref5","first-page":"127","article-title":"Factorized graph matching","author":"zhou","year":"2012","journal-title":"Proc IEEE Conf Comput Vision Pattern Recog"},{"key":"ref8","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref7","first-page":"313","article-title":"Balanced graph matching","author":"cour","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.320"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1265866"},{"key":"ref46","article-title":"Seeded graph matching","author":"fishkind","year":"2012","journal-title":"arXiv 1209 0367"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4_7"},{"key":"ref45","article-title":"Random graphs with bounded maximum degree: Asymptotic structure and a logical limit law","author":"koponen","year":"2012","journal-title":"arXiv preprint arXiv 1204 2446"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s003579900004"},{"key":"ref47","first-page":"3513","article-title":"Seeded graph matching for correlated Erdos-Renyi graphs","volume":"15","author":"lyzinski","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","article-title":"On power-law relationships of the internet topology","volume":"29","author":"faloutsos","year":"0","journal-title":"Proc ACM SIGCOMM Comput Commun Rev"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753208735"},{"key":"ref44","first-page":"319","article-title":"Algorithms for the random f-graph process","volume":"44","author":"balinska","year":"0","journal-title":"Communications in Mathematical and in Computer Chemistry"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"ref25","first-page":"33","article-title":"Mixed membership stochastic blockmodels","author":"airoldi","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7346524\/07091002.pdf?arnumber=7091002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:59:01Z","timestamp":1642003141000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7091002\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,1]]},"references-count":47,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2015.2424894","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,1]]}}}