{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:05:26Z","timestamp":1740175526612,"version":"3.37.3"},"reference-count":79,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1741197","IIS-1741129","CCF-1750539"],"award-info":[{"award-number":["IIS-1741197","IIS-1741129","CCF-1750539"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["1U01AI124302"],"award-info":[{"award-number":["1U01AI124302"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Signal and Inf. Process. over Networks"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tsipn.2020.3022003","type":"journal-article","created":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T22:11:01Z","timestamp":1599516661000},"page":"667-683","source":"Crossref","is-referenced-by-count":1,"title":["Massively Distributed Graph Distances"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8374-7286","authenticated-orcid":false,"given":"Armin","family":"Moharrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jasmin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8454-1127","authenticated-orcid":false,"given":"Shikun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1835-1530","authenticated-orcid":false,"given":"Jose","family":"Bento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8355-4751","authenticated-orcid":false,"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","first-page":"83","article-title":"The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains","volume":"30","author":"i","year":"2013"},{"key":"ref72","first-page":"438","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"0"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"article-title":"The pagerank citation ranking: Bringing order to the web","year":"1999","author":"page","key":"ref70"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1034-2"},{"key":"ref77","first-page":"1335","article-title":"The solution path of the generalized LASSO","volume":"39","author":"j","year":"2011"},{"key":"ref74","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"weisfeiler","year":"1968"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.10.013"},{"journal-title":"Introduction to Parallel Algorithms and Architectures Array Trees Hypercubes","year":"2014","author":"leighton","key":"ref75"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1142\/SMPAI"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/BF00938486"},{"key":"ref79","first-page":"532","article-title":"Reevaluating Amdahl's Law","volume":"31","author":"l","year":"1988"},{"key":"ref33","volume":"51","author":"koca","year":"2012","journal-title":"Synthon Model of Organic Chemistry and Synthesis Design"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.07.015"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72903-7_35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20844-7_11"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"ref34","first-page":"126","article-title":"On the geometry of graph spaces","volume":"214","author":"j","year":"2016"},{"key":"ref60","first-page":"17","article-title":"A dual algorithm for the ssolution of non linear variational problems via finite element approximation","volume":"2","author":"gabay","year":"1976"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472585"},{"article-title":"Fast ADMM algorithm for distributed optimization with adaptive penalty","year":"0","author":"song","key":"ref61"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6425904"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.118"},{"article-title":"Asynchronous distributed ADMM for consensus optimization","year":"0","author":"zhang","key":"ref64"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s13174-010-0003-x"},{"article-title":"Adaptive consensus ADMM for distributed optimization","year":"0","author":"xu","key":"ref65"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472595"},{"journal-title":"Computers and Intractability","year":"2002","author":"garey","key":"ref29"},{"key":"ref67","first-page":"2104","article-title":"An explicit rate bound for over-relaxed ADMM","author":"fran","year":"0"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2367458"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref2","first-page":"380","article-title":"The Cambridge Structural Database: A quarter of a million crystal structures and rising","volume":"58","author":"h","year":"2002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380754"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s000100050025"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301366"},{"key":"ref24","first-page":"1","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"3","author":"boyd","year":"2011"},{"key":"ref23","first-page":"89","article-title":"Graph isomorphism in quasipolynomial time","author":"babai","year":"0"},{"article-title":"Spark: Cluster Computing with Working Sets","year":"0","author":"zaharia","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.135"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71681-5_2"},{"key":"ref59","article-title":"Templates for convex cone problems with applications to sparse signal recovery","volume":"3","author":"r","year":"2011"},{"article-title":"Décomposition orthogonale d’un espace hilbertien selon deux cônes mutuellement polaires","year":"1962","author":"j","key":"ref58"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1561\/9781601987174"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0277-7"},{"article-title":"Fast Projections Onto l1, Q-norm balls for grouped feature selection","year":"0","author":"sra","key":"ref55"},{"article-title":"Efficient l1\/lq NormRregularization","year":"2010","author":"liu","key":"ref54"},{"key":"ref53","first-page":"1","article-title":"Probabilistic subgraph matching based on convex relaxation","author":"schellewald","year":"0"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71661-7_9"},{"key":"ref11","first-page":"755","article-title":"Fast best-effort search on graphs with multiple attributes","volume":"27","author":"b","year":"2015"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.5244\/C.19.69"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339723"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0219-z"},{"key":"ref14","first-page":"15","article-title":"Nearest-neighbor searching and metric space dimensions","author":"l","year":"2006"},{"key":"ref15","first-page":"63","article-title":"Nearest neighbor queries in metric spaces","volume":"22","author":"l","year":"1999"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45681-3_2"},{"key":"ref18","article-title":"Clustering for metric and nonmetric distance measures","volume":"6","author":"r","year":"2010"},{"key":"ref19","first-page":"35","article-title":"Optimal time bounds for approximate clustering","volume":"56","author":"r","year":"2004"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.35"},{"key":"ref3","first-page":"65","article-title":"Reaction and chemical distances and reaction graphs","volume":"79","author":"kvasni","year":"1991"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492582"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2824443"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.36"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2824443"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.3390\/a8041035"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281271"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/34.598235"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"article-title":"Unwrapping ADMM: Efficient distributed computing via transpose reduction","year":"0","author":"goldstein","key":"ref48"},{"key":"ref47","article-title":"A new graph-based method for pairwise global network alignment","volume":"10","author":"w","year":"2009"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69812-8_51"},{"key":"ref41","first-page":"2833","article-title":"A study of graph spectra for comparing graphs and trees","volume":"41","author":"c","year":"2008"},{"journal-title":"Clustering Algorithms","year":"1975","author":"hartigan","key":"ref44"},{"key":"ref43","first-page":"3084","article-title":"Distance metric learning with application to clustering with Side-Information","author":"p","year":"0"}],"container-title":["IEEE Transactions on Signal and Information Processing over Networks"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6884276\/8949869\/9187432-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6884276\/8949869\/09187432.pdf?arnumber=9187432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:32:31Z","timestamp":1651080751000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9187432\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":79,"URL":"https:\/\/doi.org\/10.1109\/tsipn.2020.3022003","relation":{},"ISSN":["2373-776X","2373-7778"],"issn-type":[{"type":"electronic","value":"2373-776X"},{"type":"electronic","value":"2373-7778"}],"subject":[],"published":{"date-parts":[[2020]]}}}