{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T23:15:40Z","timestamp":1783206940773,"version":"3.54.6"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T00:00:00Z","timestamp":1779494400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["N1-0285"],"award-info":[{"award-number":["N1-0285"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["J7-50226"],"award-info":[{"award-number":["J7-50226"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["J1-70016"],"award-info":[{"award-number":["J1-70016"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009526","name":"University of Maribor","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009526","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.amc.2026.130179","type":"journal-article","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T15:47:05Z","timestamp":1780415225000},"page":"130179","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A distribution-based framework for network similarity assessment"],"prefix":"10.1016","volume":"531","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8454-5857","authenticated-orcid":false,"given":"Matthias","family":"Dehmer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4956-0407","authenticated-orcid":false,"given":"Izudin","family":"Red\u017eepovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5564-049X","authenticated-orcid":false,"given":"Niko","family":"Tratnik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6653-9840","authenticated-orcid":false,"given":"Petra","family":"\u017digert Pleter\u0161ek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2026.130179_bib0001","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/j.apm.2018.01.027","article-title":"Properties of graph distance measures by means of discrete inequalities","volume":"59","author":"Dehmer","year":"2018","journal-title":"Appl. Math. Model."},{"key":"10.1016\/j.amc.2026.130179_bib0002","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2019.06.035","article-title":"On efficient network similarity measures","volume":"362","author":"Dehmer","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.amc.2026.130179_bib0003","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0094985","article-title":"Interrelations of graph distance measures based on topological indices","volume":"9","author":"Dehmer","year":"2014","journal-title":"PLoS ONE"},{"key":"10.1016\/j.amc.2026.130179_bib0004","series-title":"Structural Matching in Information Processing, Ph.D. thesis","author":"Sussenguth","year":"1964"},{"key":"10.1016\/j.amc.2026.130179_bib0005","doi-asserted-by":"crossref","first-page":"371","DOI":"10.21136\/CPM.1975.117890","article-title":"On a certain distance between isomorphism classes of graphs","volume":"100","author":"Zelinka","year":"1975","journal-title":"\u010casopis pro p\u0306est. Mathematiky"},{"key":"10.1016\/j.amc.2026.130179_bib0006","first-page":"35","article-title":"What is the distance between graphs?","volume":"20","author":"Bunke","year":"1983","journal-title":"Bull. EATCS"},{"key":"10.1016\/j.amc.2026.130179_bib0007","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","article-title":"A survey of graph edit distance","volume":"13","author":"Gao","year":"2010","journal-title":"Pattern Anal. Appl."},{"key":"10.1016\/j.amc.2026.130179_bib0008","article-title":"A method for measuring similarity or distance of molecular and arbitrary graphs based on a collection of topological indices","volume":"39","author":"Sinan \u00d6z","year":"2025","journal-title":"J. Chemom."},{"key":"10.1016\/j.amc.2026.130179_bib0009","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1016\/j.amc.2006.11.185","article-title":"Comparing large graphs efficiently by margins of feature vectors","volume":"188","author":"Dehmer","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.amc.2026.130179_bib0010","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.ins.2016.01.074","article-title":"Fifty years of graph matching, network alignment and network comparison","volume":"346\u2013347","author":"Emmert-Streib","year":"2016","journal-title":"Inf. Sci."},{"key":"10.1016\/j.amc.2026.130179_bib0011","series-title":"Principles of Verification: Cycling the Probabilistic Landscape","first-page":"369","article-title":"Some thoughts on graph similarity","volume":"15260","author":"Grohe","year":"2025"},{"key":"10.1016\/j.amc.2026.130179_bib0012","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0228728","article-title":"Metrics for graph comparison: a practitioner\u2019s guide","volume":"15","author":"Wills","year":"2020","journal-title":"PLoS ONE"},{"key":"10.1016\/j.amc.2026.130179_bib0013","first-page":"5","article-title":"Efficient graph similarity assessment method based on vectors of topological indices","volume":"97","author":"Dehmer","year":"2027","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.amc.2026.130179_bib0014","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1515\/crll.1909.136.210","article-title":"Neue Begr\u00fcndung der Theorie quadratischer Formen von unendlich vielen Ver\u00e4nderlichen","volume":"136","author":"Hellinger","year":"1909","journal-title":"J. F\u00fcr Reine Angew. Math."},{"key":"10.1016\/j.amc.2026.130179_bib0015","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","article-title":"On information and sufficiency","volume":"22","author":"Kullback","year":"1951","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/j.amc.2026.130179_bib0016","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/18.61115","article-title":"Divergence measures based on the Shannon entropy","volume":"37","author":"Lin","year":"1991","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.amc.2026.130179_bib0017","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.12988\/ijma.2014.46154","article-title":"Polynomial representation and degree sequence of a graph","volume":"8","author":"Canoy Jr","year":"2014","journal-title":"Int. J. Math. Anal."},{"key":"10.1016\/j.amc.2026.130179_bib0018","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(88)90017-0","article-title":"On some counting polynomials in chemistry","volume":"19","author":"Hosoya","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130179_bib0019","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/s41109-019-0195-3","article-title":"A survey on graph kernels","volume":"5","author":"Kriege","year":"2020","journal-title":"Appl. Netw. Sci."},{"key":"10.1016\/j.amc.2026.130179_bib0020","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs. I","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publ. Math. Debr."},{"key":"10.1016\/j.amc.2026.130179_bib0021","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"10.1016\/j.amc.2026.130179_bib0022","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u201csmall-world\u201d networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"10.1016\/j.amc.2026.130179_bib0023","series-title":"Networks: An Introduction","author":"Newman","year":"2010"},{"key":"10.1016\/j.amc.2026.130179_bib0024","series-title":"Technical Report","article-title":"Network Analysis of Trophic Dynamics in South Florida Ecosystems, FY97: The Florida Bay Ecosystem","author":"Ulanowicz","year":"1998"},{"key":"10.1016\/j.amc.2026.130179_bib0025","series-title":"Proc. AAAI","article-title":"The network data repository with interactive graph analytics and visualization","volume":"29","author":"Rossi","year":"2015"},{"key":"10.1016\/j.amc.2026.130179_bib0026","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1890\/02-0638","article-title":"Food web cohesion","volume":"85","author":"Meli\u00e1n","year":"2004","journal-title":"Ecology"},{"key":"10.1016\/j.amc.2026.130179_bib0027","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1006\/jtbi.2001.2460","article-title":"Small world patterns in food webs","volume":"214","author":"Montoya","year":"2002","journal-title":"J. Theor. Biol."},{"key":"10.1016\/j.amc.2026.130179_bib0028","doi-asserted-by":"crossref","first-page":"12917","DOI":"10.1073\/pnas.192407699","article-title":"Foodweb structure and network theory: the role of connectance and size","volume":"99","author":"Dunne","year":"2002","journal-title":"PNAS"},{"key":"10.1016\/j.amc.2026.130179_bib0029","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1021\/ci100050t","article-title":"Extended-connectivity fingerprints","volume":"50","author":"Rogers","year":"2010","journal-title":"J. Chem. Inf. Model."},{"key":"10.1016\/j.amc.2026.130179_bib0030","first-page":"1273","article-title":"Reoptimization of MDL keys for use in drug discovery","volume":"42","author":"Durant","year":"2002","journal-title":"J. Chem. Inf. Model."},{"key":"10.1016\/j.amc.2026.130179_bib0031","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1186\/s13321-015-0069-3","article-title":"Why is Tanimoto index an appropriate choice for fingerprint-based similarity calculations?","volume":"7","author":"Bajusz","year":"2015","journal-title":"J. Cheminform."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326002316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326002316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T22:21:15Z","timestamp":1783203675000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300326002316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":31,"alternative-id":["S0096300326002316"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2026.130179","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A distribution-based framework for network similarity assessment","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2026.130179","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"130179"}}