{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:29:56Z","timestamp":1780385396195,"version":"3.54.1"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006831","name":"U.S. Air Force","doi-asserted-by":"publisher","award":["FA8750-18-2-0035"],"award-info":[{"award-number":["FA8750-18-2-0035"]}],"id":[{"id":"10.13039\/100006831","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-20-2-100"],"award-info":[{"award-number":["FA8750-20-2-100"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007187","name":"Lincoln Laboratory, Massachusetts Institute of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007187","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000005","name":"U.S. Department of Defense","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the problem of detecting a noisy induced multiplex template network in a larger multiplex background network. Our approach, which extends the graph matching matched filter framework of Sussman et al. (IEEE Trans Pattern Anal Mach Intell 42(11):2887\u20132900, 2019) to the multiplex setting, utilizes a multiplex analogue of the classical graph matching problem to use the template as a matched filter for efficiently searching the background for candidate template matches. The effectiveness of our approach is demonstrated both theoretically and empirically, with particular attention paid to the potential benefits of considering multiple channels in the multiplex framework.<\/jats:p>","DOI":"10.1007\/s41109-022-00464-0","type":"journal-article","created":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T09:06:43Z","timestamp":1652432803000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multiplex graph matching matched filters"],"prefix":"10.1007","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2989-010X","authenticated-orcid":false,"given":"Konstantinos","family":"Pantazis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel L.","family":"Sussman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youngser","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhirui","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carey E.","family":"Priebe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vince","family":"Lyzinski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,13]]},"reference":[{"issue":"10","key":"464_CR1","doi-asserted-by":"publisher","first-page":"2942","DOI":"10.1073\/pnas.1401651112","volume":"112","author":"Y Aflalo","year":"2015","unstructured":"Aflalo Y, Bronstein A, Kimmel R (2015) On convex relaxation of graph isomorphism. Proc Natl Acad Sci 112(10):2942\u20132947","journal-title":"Proc Natl Acad Sci"},{"issue":"13","key":"464_CR2","doi-asserted-by":"publisher","first-page":"i241","DOI":"10.1093\/bioinformatics\/btn163","volume":"24","author":"N Alon","year":"2008","unstructured":"Alon N, Dao P, Hajirasouliha I, Hormozdiari F, Sahinalp SC (2008) Biomolecular network motif counting and discovery by color coding. Bioinformatics 24(13):i241\u2013i249","journal-title":"Bioinformatics"},{"issue":"4","key":"464_CR3","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon N, Yuster R, Zwick U (1995) Color-coding. J ACM (JACM) 42(4):844\u2013856","journal-title":"J ACM (JACM)"},{"key":"464_CR4","unstructured":"Arroyo J, Sussman DL, Priebe CE, Lyzinski V (2018) Maximum likelihood estimation and graph matching in errorfully observed networks. arXiv preprint arXiv:1812.10519"},{"key":"464_CR5","unstructured":"Barak B, Chou C, Lei Z, Schramm T, Sheng Y (2018) (nearly) efficient algorithms for the graph matching problem on correlated random graphs. arXiv preprint arXiv:1805.02349"},{"issue":"1","key":"464_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0219-z","volume":"4","author":"J Bento","year":"2019","unstructured":"Bento J, Ioannidis S (2019) A family of tractable graph metrics. Appl Netw Sci 4(1):1\u201327","journal-title":"Appl Netw Sci"},{"issue":"1","key":"464_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2014.07.001","volume":"544","author":"S Boccaletti","year":"2014","unstructured":"Boccaletti S, Bianconi G, Criado R, Del Genio CI, G\u00f3mez-Gardenes J, Romance M, Sendina-Nadal I, Wang Z, Zanin M (2014) The structure and dynamics of multilayer networks. Phys Rep 544(1):1\u2013122","journal-title":"Phys Rep"},{"key":"464_CR8","doi-asserted-by":"crossref","unstructured":"Chan SC, Cheney J (2020) Flexible graph matching and graph edit distance using answer set programming. In: International symposium on practical aspects of declarative languages, pp 20\u201336. Springer","DOI":"10.1007\/978-3-030-39197-3_2"},{"issue":"3","key":"464_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1109\/42.34715","volume":"8","author":"S Chaudhuri","year":"1989","unstructured":"Chaudhuri S, Chatterjee S, Katz N, Nelson M, Goldbaum M (1989) Detection of blood vessels in retinal images using two-dimensional matched filters. IEEE Trans Med Imaging 8(3):263\u2013269","journal-title":"IEEE Trans Med Imaging"},{"key":"464_CR10","doi-asserted-by":"crossref","unstructured":"Chen L, Vogelstein JT, Lyzinski V, Priebe CE (2016) A joint graph inference case study: the C. elegans chemical and electrical connectomes. Worm 5(2)","DOI":"10.1080\/21624054.2016.1142041"},{"issue":"03","key":"464_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte D, Foggia P, Sansone C, Vento M (2004) Thirty years of graph matching in pattern recognition. Int J Pattern Recognit Artif Intell 18(03):265\u2013298","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"10","key":"464_CR12","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"464_CR13","doi-asserted-by":"crossref","unstructured":"Cullina D, Kiyavash N (2016) Improved achievability and converse bounds for erdos-r\u00e9nyi graph matching. In: ACM SIGMETRICS performance evaluation review, 44(1), pp 63\u201372. ACM","DOI":"10.1145\/2964791.2901460"},{"key":"464_CR14","unstructured":"Cullina D, Kiyavash N (2017) Exact alignment recovery for correlated Erdos-Renyi graphs. arXiv preprint arXiv:1711.06783"},{"key":"464_CR15","doi-asserted-by":"crossref","unstructured":"Cullina D, Kiyavash N, Mittal P, Poor HV (2018) Partial recovery of Erdos-Renyi graph alignment via $$k$$-core alignment. arXiv preprint arXiv:1809.03553","DOI":"10.1145\/3366702"},{"issue":"1\u20133","key":"464_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0167-8655(02)00186-1","volume":"24","author":"F DePiero","year":"2003","unstructured":"DePiero F, Krout D (2003) An algorithm using length-r paths to approximate subgraph isomorphism. Pattern Recognit Lett 24(1\u20133):33\u201346","journal-title":"Pattern Recognit Lett"},{"key":"464_CR17","unstructured":"Ding J, Ma Z, Wu Y, Xu J (2018) Efficient random graph matching via degree profiles. arXiv preprint arXiv:1811.07821"},{"key":"464_CR18","doi-asserted-by":"crossref","unstructured":"Du B, Zhang S, Cao N, Tong H (2017) First: Fast interactive attributed subgraph matching. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 1447\u20131456","DOI":"10.1145\/3097983.3098040"},{"key":"464_CR19","unstructured":"Du X, Yan J, Zhang R, Zha H (2020) Cross-network skip-gram embedding for joint network alignment and link prediction. IEEE Trans Knowl Data Eng"},{"key":"464_CR20","doi-asserted-by":"crossref","unstructured":"Ebsch CL, Cottam JA, Heller NC, Deshmukh RD, Chin G (2020) Using graph edit distance for noisy subgraph matching of semantic property graphs. In: 2020 IEEE international conference on big data (big data), pp 2520\u20132525. IEEE","DOI":"10.1109\/BigData50022.2020.9378349"},{"issue":"1","key":"464_CR21","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/TPAMI.2012.51","volume":"35","author":"A Egozi","year":"2012","unstructured":"Egozi A, Keller Y, Guterman H (2012) A probabilistic approach to spectral graph matching. IEEE Trans Pattern Anal Mach Intell 35(1):18\u201327","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"464_CR22","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ins.2016.01.074","volume":"346\u2013347","author":"F Emmert-Streib","year":"2016","unstructured":"Emmert-Streib F, Dehmer M, Shi Y (2016) Fifty years of graph matching, network alignment and network comparison. Inf Sci 346\u2013347:180\u2013197","journal-title":"Inf Sci"},{"key":"464_CR23","unstructured":"Fan Z, Mao C, Wu Y, Xu J (2020) Spectral graph matching and regularized quadratic relaxations: algorithm and theory. In: International conference on machine learning, pp 2985\u20132995. PMLR"},{"key":"464_CR24","unstructured":"Fang F, Sussman DL, Lyzinski V (2018) Tractable graph matching via soft seeding. arXiv preprint arXiv:1807.09299"},{"key":"464_CR25","unstructured":"Feizi S, Quon G, Medard M, Kellis M, Jadbabaie A (2015) Spectral alignment of networks"},{"issue":"3","key":"464_CR26","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1214\/15-AOAS834","volume":"9","author":"DE Fishkind","year":"2015","unstructured":"Fishkind DE, Lyzinski V, Pao H, Chen L, Priebe CE (2015) Vertex nomination schemes for membership prediction. Ann Appl Stat 9(3):1510\u20131532","journal-title":"Ann Appl Stat"},{"key":"464_CR27","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.patcog.2018.09.014","volume":"87","author":"DE Fishkind","year":"2019","unstructured":"Fishkind DE, Adali S, Patsolic HG, Meng L, Singh D, Lyzinski V, Priebe CE (2019) Seeded graph matching. Pattern Recognit 87:203\u2013215","journal-title":"Pattern Recognit"},{"issue":"01","key":"464_CR28","doi-asserted-by":"publisher","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia P, Percannella G, Vento M (2014) Graph matching and learning in pattern recognition in the last 10 years. Int J Pattern Recognit Artif Intell 28(01):1450001","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"3","key":"464_CR29","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1016\/j.jcss.2011.10.001","volume":"78","author":"FV Fomin","year":"2012","unstructured":"Fomin FV, Lokshtanov D, Raman V, Saurabh S, Rao BVR (2012) Faster algorithms for finding and counting subgraphs. J Comput Syst Sci 78(3):698\u2013706","journal-title":"J Comput Syst Sci"},{"issue":"1\u20132","key":"464_CR30","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank M, Wolfe P (1956) An algorithm for quadratic programming. Nav Res Logist Q 3(1\u20132):95\u2013110","journal-title":"Nav Res Logist Q"},{"key":"464_CR31","doi-asserted-by":"crossref","unstructured":"Goga O, Loiseau P, Sommer R, Teixeira R, Gummadi KP (2015) On the reliability of profile matching across large online social networks. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1799\u20131808. ACM","DOI":"10.1145\/2783258.2788601"},{"key":"464_CR32","doi-asserted-by":"crossref","unstructured":"Heimann M, Shen H, Safavi T, Koutra D (2018) Regal: representation learning-based graph alignment. In: Proceedings of the 27th ACM international conference on information and knowledge management, pp 117\u2013126","DOI":"10.1145\/3269206.3271788"},{"issue":"4","key":"464_CR33","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker R, Volgenant A (1987) A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4):325\u2013340","journal-title":"Computing"},{"issue":"10","key":"464_CR34","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.14778\/2794367.2794371","volume":"8","author":"E Kazemi","year":"2015","unstructured":"Kazemi E, Hassani SH, Grossglauser M (2015a) Growing a graph matching from a handful of seeds. Proc VLDB Endow 8(10):1010\u20131021","journal-title":"Proc VLDB Endow"},{"key":"464_CR35","doi-asserted-by":"crossref","unstructured":"Kazemi E, Yartseva L, Grossglauser M (2015b) When can two unlabeled networks be aligned under partial overlap? In: 2015 53rd Annual allerton conference on communication, control, and computing (Allerton), pp 33\u201342. IEEE","DOI":"10.1109\/ALLERTON.2015.7446983"},{"key":"464_CR36","doi-asserted-by":"crossref","unstructured":"Kiar G, Bridgeford EW, Roncal WRG, Chandrashekhar V, Mhembere D, Ryman S, Zuo X, Margulies DS, Craddock RC, Priebe CE, Jung R, Calhoun VD, Caffo B, Burns R, Milham MP, Vogelstein JT (2018) A high-throughput pipeline identifies robust connectomes but troublesome variability. bioRxiv, p 188706","DOI":"10.1101\/188706"},{"issue":"3","key":"464_CR37","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1093\/comnet\/cnu016","volume":"2","author":"M Kivel\u00e4","year":"2014","unstructured":"Kivel\u00e4 M, Arenas A, Barthelemy M, Gleeson JP, Moreno Y, Porter MA (2014) Multilayer networks. J Complex Netw 2(3):203\u2013271","journal-title":"J Complex Netw"},{"key":"464_CR38","doi-asserted-by":"crossref","unstructured":"Kivel\u00e4 M, Porter MA (2017) Isomorphisms in multilayer networks. IEEE Trans Netw Sci Eng","DOI":"10.1109\/TNSE.2017.2753963"},{"issue":"1","key":"464_CR39","doi-asserted-by":"publisher","first-page":"S59","DOI":"10.1186\/1471-2105-10-S1-S59","volume":"10","author":"GW Klau","year":"2009","unstructured":"Klau GW (2009) A new graph-based method for pairwise global network alignment. BMC Bioinf 10(1):S59","journal-title":"BMC Bioinf"},{"key":"464_CR40","doi-asserted-by":"crossref","unstructured":"Kopylov A, Xu J (2019) Filtering strategies for inexact subgraph matching on noisy multiplex networks. In: 2019 IEEE international conference on big data (big data), pp 4906\u20134912. IEEE","DOI":"10.1109\/BigData47090.2019.9006047"},{"key":"464_CR41","doi-asserted-by":"crossref","unstructured":"Kopylov A, Xu J, Ni K, Roach S, Lu T-C (2020) Semantic guided filtering strategy for best-effort subgraph matching in knowledge graphs. In: 2020 IEEE international conference on big data (big data), pp 2539\u20132545. IEEE","DOI":"10.1109\/BigData50022.2020.9378003"},{"key":"464_CR42","unstructured":"Krizhevsky A, Sutskever I, Hinton GE (2012) Imagenet classification with deep convolutional neural networks. Adv Neural Inf Process Syst 25"},{"issue":"4","key":"464_CR43","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0960129501003577","volume":"12","author":"J Larrosa","year":"2002","unstructured":"Larrosa J, Valiente G (2002) Constraint satisfaction algorithms for graph pattern matching. Math Struct Comput Sci 12(4):403\u2013422","journal-title":"Math Struct Comput Sci"},{"key":"464_CR44","doi-asserted-by":"crossref","unstructured":"Lee J, Han W, Kasperovics R, Lee J. (2012) An in-depth comparison of subgraph isomorphism algorithms in graph databases. Proc VLDB Endow 6(2):133\u2013144","DOI":"10.14778\/2535568.2448946"},{"key":"464_CR45","doi-asserted-by":"crossref","unstructured":"Liu L, Du B, Tong H (2019) G-finder: approximate attributed subgraph matching. In: 2019 IEEE international conference on big data (big data), pp 513\u2013522. IEEE","DOI":"10.1109\/BigData47090.2019.9006525"},{"issue":"10","key":"464_CR46","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1109\/34.954603","volume":"23","author":"J Llad\u00f3s","year":"2001","unstructured":"Llad\u00f3s J, Mart\u00ed E, Villanueva JJ (2001) Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. IEEE Trans Pattern Anal Mach Intell 23(10):1137\u20131143","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"464_CR47","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/TPAMI.2015.2424894","volume":"38","author":"V Lyzinski","year":"2015","unstructured":"Lyzinski V, Fishkind D, Fiori M, Vogelstein JT, Priebe CE, Sapiro G (2015) Graph matching: relax at your own risk. IEEE Trans Pattern Anal Mach Intell 38(1):60\u201373","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"464_CR48","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1093\/imaiai\/iaz031","volume":"9","author":"V Lyzinski","year":"2020","unstructured":"Lyzinski V, Sussman DL (2020) Matchability of heterogeneous networks pairs. Inf Inference A J IMA 9(4):749\u2013783","journal-title":"Inf Inference A J IMA"},{"key":"464_CR49","doi-asserted-by":"crossref","unstructured":"Magnani M, Rossi L (2011) The ml-model for multi-layer social networks. In: 2011 International conference on advances in social networks analysis and mining, pp 5\u201312. IEEE","DOI":"10.1109\/ASONAM.2011.114"},{"issue":"1","key":"464_CR50","first-page":"148","volume":"141","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid C (1989) On the method of bounded differences. Surv Combin 141(1):148\u2013188","journal-title":"Surv Combin"},{"key":"464_CR51","doi-asserted-by":"crossref","unstructured":"Moorman JD, Chen Q, Tu TK, Boyd ZM, Bertozzi AL (2018) Filtering methods for subgraph matching on multiplex networks. In: 2018 IEEE international conference on big data (big data), pp 3980\u20133985. IEEE","DOI":"10.1109\/BigData.2018.8622566"},{"issue":"2","key":"464_CR52","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TNSE.2021.3056329","volume":"8","author":"JD Moorman","year":"2021","unstructured":"Moorman JD, Tu TK, Chen Q, He X, Bertozzi AL (2021) Subgraph matching on multiplex networks. IEEE Trans Netw Sci Eng 8(2):1367\u20131384","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"5980","key":"464_CR53","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1126\/science.1184819","volume":"328","author":"PJ Mucha","year":"2010","unstructured":"Mucha PJ, Richardson T, Macon K, Porter MA, Onnela J (2010) Community structure in time-dependent, multiscale, and multiplex networks. Science 328(5980):876\u2013878","journal-title":"Science"},{"key":"464_CR54","doi-asserted-by":"crossref","unstructured":"Ng MK, Li X, Ye Y (2011) Multirank: co-ranking for objects and relations in multi-relational data. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1217\u20131225. ACM","DOI":"10.1145\/2020408.2020594"},{"key":"464_CR55","doi-asserted-by":"crossref","unstructured":"Onaran E, Garg S, Erkip E (2016) Optimal de-anonymization in random graphs with community structure. In: 2016 50th Asilomar conference on signals, systems and computers, pp 709\u2013713. IEEE","DOI":"10.1109\/ACSSC.2016.7869137"},{"key":"464_CR56","unstructured":"O\u2019Shea K, Nash R (2015) An introduction to convolutional neural networks. arXiv preprint arXiv:1511.08458"},{"key":"464_CR57","unstructured":"Patsolic H, Adali S, Vogelstein JT, Park Y, Priebe CE, Li G, and Lyzinski V (2014) Seeded graph matching via joint optimization of fidelity and commensurability. arXiv preprint arXiv:1401.3813"},{"key":"464_CR58","doi-asserted-by":"crossref","unstructured":"Pedarsani P, Grossglauser M (2011) On the privacy of anonymized networks. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1235\u20131243. ACM","DOI":"10.1145\/2020408.2020596"},{"issue":"11","key":"464_CR59","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1109\/TPAMI.2016.2636200","volume":"39","author":"MA Pinheiro","year":"2016","unstructured":"Pinheiro MA, Kybic J, Fua P (2016) Geometric graph matching using Monte Carlo tree search. IEEE Trans Pattern Anal Mach Intell 39(11):2171\u20132185","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"464_CR60","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1080\/10618600.2014.951049","volume":"24","author":"CE Priebe","year":"2015","unstructured":"Priebe CE, Sussman DL, Tang M, Vogelstein JT (2015) Statistical inference on errorfully observed graphs. J Comput Graph Stat 24(4):930\u2013953","journal-title":"J Comput Graph Stat"},{"issue":"35","key":"464_CR61","doi-asserted-by":"publisher","first-page":"12763","DOI":"10.1073\/pnas.0806627105","volume":"105","author":"R Singh","year":"2008","unstructured":"Singh R, Xu J, Berger B (2008) Global alignment of multiple protein interaction networks with application to functional orthology detection. Proc Natl Acad Sci 105(35):12763\u201312768","journal-title":"Proc Natl Acad Sci"},{"key":"464_CR62","doi-asserted-by":"crossref","unstructured":"Sussman DL, Park Y, Priebe CE, Lyzinski V (2019) Matched filters for noisy induced subgraph detection. IEEE Trans Pattern Anal Mach Intell 42(11):2887\u20132900","DOI":"10.1109\/TPAMI.2019.2914651"},{"key":"464_CR63","doi-asserted-by":"crossref","unstructured":"Takes FW, Kosters WA, Witte B (2017) Detecting motifs in multiplex corporate networks. In: International workshop on complex networks and their applications, pp 502\u2013515. Springer","DOI":"10.1007\/978-3-319-72150-7_41"},{"key":"464_CR64","doi-asserted-by":"crossref","unstructured":"Tu TK, Moorman JD, Yang D, Chen Q, Bertozzi AL (2020) Inexact attributed subgraph matching. In: 2020 IEEE international conference on big data (big data), pp 2575\u20132582. IEEE","DOI":"10.1109\/BigData50022.2020.9377872"},{"issue":"1","key":"464_CR65","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM (JACM) 23(1):31\u201342","journal-title":"J ACM (JACM)"},{"issue":"5","key":"464_CR66","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S Umeyama","year":"1988","unstructured":"Umeyama S (1988) An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Anal Mach Intell 10(5):695\u2013703","journal-title":"IEEE Transactions on Pattern Anal Mach Intell"},{"key":"464_CR67","doi-asserted-by":"crossref","unstructured":"Vogelstein JT, Conroy JM, Lyzinski V, Podrazik LJ, Kratzer SG, Harley ET, Fishkind DE, Vogelstein RT, Priebe CE (2014) Fast approximate quadratic programming for graph matching. PLoS ONE 10(4):1","DOI":"10.1371\/journal.pone.0121002"},{"issue":"1165","key":"464_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1098\/rstb.1986.0056","volume":"314","author":"JG White","year":"1986","unstructured":"White JG, Southgate E, Thomson JN, Brenner S (1986) The structure of the nervous system of the nematode caenorhabditis elegans. Philos Trans R Soc Lond B Biol Sci 314(1165):1\u2013340","journal-title":"Philos Trans R Soc Lond B Biol Sci"},{"key":"464_CR69","doi-asserted-by":"crossref","unstructured":"Yan J, Yin X, Lin W, Deng C, Zha H, Yang X (2016) A short survey of recent advances in graph matching. In: Proceedings of the 2016 ACM on international conference on multimedia retrieval, pp 167\u2013174. ACM","DOI":"10.1145\/2911996.2912035"},{"key":"464_CR70","doi-asserted-by":"crossref","unstructured":"Yang B, Liu J (2016) Mining multiplex structural patterns from complex networks. In: Wisdom Web of Things, pp 275\u2013301. Springer","DOI":"10.1007\/978-3-319-44198-6_12"},{"issue":"3","key":"464_CR71","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10601-009-9074-3","volume":"15","author":"S Zampelli","year":"2010","unstructured":"Zampelli S, Deville Y, Solnon C (2010) Solving subgraph isomorphism problems with constraint programming. Constraints 15(3):327\u2013353","journal-title":"Constraints"},{"key":"464_CR72","doi-asserted-by":"crossref","unstructured":"Zanfir A, Sminchisescu C (2018) Deep learning of graph matching. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2684\u20132693","DOI":"10.1109\/CVPR.2018.00284"},{"issue":"12","key":"464_CR73","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy M, Bach F, Vert JP (2009) A path following algorithm for the graph matching problem. IEEE Trans on Pattern Anal Mach Intell 31(12):2227\u20132242","journal-title":"IEEE Trans on Pattern Anal Mach Intell"},{"key":"464_CR74","doi-asserted-by":"crossref","unstructured":"Zhang S, Tong H (2016) Final: Fast attributed network alignment. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 1345\u20131354","DOI":"10.1145\/2939672.2939766"},{"key":"464_CR75","unstructured":"Zhang Z, Xiang Y, Wu L, Xue B, Nehorai A (2019) Kergm: Kernelized graph matching. Adv Neural Inf Proces Syst 32"},{"key":"464_CR76","doi-asserted-by":"crossref","unstructured":"Zhou F, De\u00a0la Torre F (2012) Factorized graph matching. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp 127\u2013134. IEEE","DOI":"10.1109\/CVPR.2013.376"},{"issue":"1","key":"464_CR77","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/sdata.2014.49","volume":"1","author":"X-N Zuo","year":"2014","unstructured":"Zuo X-N, Anderson JS, Bellec P, Birn RM, Biswal BB, Blautzik J, Breitner J, Buckner RL, Calhoun VD, Castellanos FX et al (2014) An open science resource for establishing reliability and reproducibility in functional connectomics. Sci Data 1(1):1\u201313","journal-title":"Sci Data"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-022-00464-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-022-00464-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-022-00464-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T21:09:12Z","timestamp":1652476152000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-022-00464-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,13]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["464"],"URL":"https:\/\/doi.org\/10.1007\/s41109-022-00464-0","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,13]]},"assertion":[{"value":"3 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"29"}}