{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T21:57:24Z","timestamp":1764194244809},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,10]],"date-time":"2017-09-10T00:00:00Z","timestamp":1505001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s11036-017-0914-x","type":"journal-article","created":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T17:15:53Z","timestamp":1505150153000},"page":"407-419","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Influence of Krylov subspace in Graph Isomorphism for Mobile Networks"],"prefix":"10.1007","volume":"24","author":[{"given":"T.","family":"Ramraj","sequence":"first","affiliation":[]},{"given":"R.","family":"Prabhakar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,10]]},"reference":[{"issue":"8","key":"914_CR1","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1162\/089976699300016034","volume":"11","author":"M Pelillo","year":"1999","unstructured":"Pelillo M (1999) Replicator equations, maximal cliques, and graph isomorphism. Neural Comput 11(8):1933\u20131955","journal-title":"Neural Comput"},{"issue":"3","key":"914_CR2","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. Intl J Patt Recog Art Intel 18(3):265\u2013298","journal-title":"Intl J Patt Recog Art Intel"},{"key":"914_CR3","doi-asserted-by":"crossref","unstructured":"Pinheiro MA, Kybic J (2016) Geometric graph matching using monte carlo tree search. IEEE Trans Patt Anal Mach Int","DOI":"10.1109\/ICIP.2015.7351383"},{"key":"914_CR4","doi-asserted-by":"crossref","unstructured":"Gori M, Maggini M, Sarti L (2005) Exact and approximate graph matching using random walks. IEEE Trans Patt Anal Mach Int 27(7)","DOI":"10.1109\/TPAMI.2005.138"},{"key":"914_CR5","doi-asserted-by":"crossref","unstructured":"Tuzel O, Porikli F, Meer P (2006) Region covariance: a fast descriptor for detection and classification. Proc European Conf Comput Vis","DOI":"10.1007\/11744047_45"},{"key":"914_CR6","unstructured":"Porikli F, Tuzel O (2006) Covariance tracker. Proc IEEE Conf Comput Vis Patt Recogn"},{"issue":"7","key":"914_CR7","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1109\/TCSVT.2008.924108","volume":"18","author":"Y Pang","year":"2008","unstructured":"Pang Y, Yuan Y, Li X (2008) Gabor-Based Region Covariance Matrices for Face Recognition. IEEE Trans Circ Syst Video Technol 18(7):989\u2013993","journal-title":"IEEE Trans Circ Syst Video Technol"},{"key":"914_CR8","doi-asserted-by":"crossref","unstructured":"Ullmann, Julian R (2010) Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J Exp Algorith","DOI":"10.1145\/1671970.1921702"},{"key":"914_CR9","unstructured":"Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Add Wesley"},{"key":"914_CR10","doi-asserted-by":"crossref","unstructured":"Hopcroft JE, Wong J (1974) Linear time algorithm for isomorphism of planar graphs. Proc 6th Ann ACM Symposium Theory Comput 172\u2013184","DOI":"10.1145\/800119.803896"},{"issue":"3","key":"914_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10044-004-0222-5","volume":"7","author":"PJ Dickinson","year":"2004","unstructured":"Dickinson PJ, Bunke H, Dadej A, Kraetzl M (2004) Matching graphs with unique node labels. Pattern Anal Applic 7(3):243\u2013254","journal-title":"Pattern Anal Applic"},{"issue":"17","key":"914_CR12","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/S0031-3203(98)00145-9","volume":"32","author":"X Jiang","year":"1999","unstructured":"Jiang X, Bunke H (1999) Optimal quadratic-time isomorphism of ordered graphs. Pattern Recogn 32(17):1273\u20131283","journal-title":"Pattern Recogn"},{"issue":"1","key":"914_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"Luks EM (1982) Isomorphism of graphs of bounded valence can be tested in polynomial time. J Comput Syst Sci 25(1):42\u201365","journal-title":"J Comput Syst Sci"},{"key":"914_CR14","doi-asserted-by":"crossref","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (1999) Performance evaluation of the vf graph matching algorithm. Proc. 10th Int\u2019l Conf Image Anal Proc 1172\u20131177","DOI":"10.1109\/ICIAP.1999.797762"},{"issue":"20","key":"914_CR15","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 Patt Anal Mach Intel 26(20):1367\u20131372","journal-title":"IEEE Trans Patt Anal Mach Intel"},{"issue":"12","key":"914_CR16","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1016\/S0031-3203(98)90142-X","volume":"32","author":"BT Messmer","year":"1999","unstructured":"Messmer BT, Bunke H (1999) A decision tree approach to graph and subgraph isomorphism detection. Pattern Recogn 32(12):1979\u20131998","journal-title":"Pattern Recogn"},{"key":"914_CR17","doi-asserted-by":"crossref","unstructured":"He H, Singh AK (2008) Graphs-at-a-time: query language and access methods for graph databases. SIGMOD-08 405\u2013418","DOI":"10.1145\/1376616.1376660"},{"key":"914_CR18","doi-asserted-by":"crossref","unstructured":"Zhang S, Li S, Yang J (2009) GADDI: distance index based subgraph matching in biological networks. EDBT 192\u2013203","DOI":"10.1145\/1516360.1516384"},{"issue":"1","key":"914_CR19","first-page":"340","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao P, Han J (2010) On graph query optimization in large networks. PVLDB 3(1):340\u2013351","journal-title":"PVLDB"},{"key":"914_CR20","doi-asserted-by":"crossref","unstructured":"Ambauen R, Fischer S Bunke H (2003) Graph edit distance with node splitting and merging and its application to diatom identification. In Proc 4th Intl. workshop on Graph Based Representations in Pattern Recognition, LNCS 2726, Springer. 95\u2013106","DOI":"10.1007\/3-540-45028-9_9"},{"key":"914_CR21","doi-asserted-by":"crossref","unstructured":"Cherian A, Sra S, Banerjee A, Papanikolopoulos N (2013) Jensen- Bregman LogDet divergence with application to efficient similarity search for covariance matrices. IEEE Trans Patt Anal Mach Intel 35(9)","DOI":"10.1109\/TPAMI.2012.259"},{"key":"914_CR22","unstructured":"Querido T, Loiola EM, De Abreu NM, Boaventura-Netto PO, Hahn P (2007) A survey for the quadratic assignment problem. EJOR 657\u2013690"},{"issue":"4","key":"914_CR23","first-page":"300","volume":"1","author":"S Hyuk Cha","year":"2007","unstructured":"Hyuk Cha S (2007) Comprehensive survey on distance \/ similarity measures between probability density functions. Int J Math Model Methods Appl Sci 1(4):300\u2013307","journal-title":"Int J Math Model Methods Appl Sci"},{"key":"914_CR24","unstructured":"De Jong KA, Spears WM (1989) Using genetic algorithm to solve NP-complete problems. Proc Int\u2019l Conf Genet Algorithms 124\u2013132"},{"issue":"10","key":"914_CR25","doi-asserted-by":"publisher","first-page":"2942","DOI":"10.1073\/pnas.1401651112","volume":"112","author":"Y Aalo","year":"2015","unstructured":"Aalo Y, Bronstein A, Kimmel R (2015) On convex relaxation of graph isomorphism. Proc Ntnl Acad Sci 112(10):2942\u20132947","journal-title":"Proc Ntnl Acad Sci"},{"key":"914_CR26","unstructured":"Shrivastava A, Li P (1996) A new space for comparing graphs. IEEE\/ ACM Intl Conf Adv Soc Netw Anal Mining"},{"key":"914_CR27","doi-asserted-by":"crossref","unstructured":"Wang J, Wang H, Zhou Y, McDonald N (2015) Multiple Kernel Multivariate Performance Learning Using Cutting Plane Algorithm IEEE Intl Conf on Syst Man Cybernet 187\u20131875","DOI":"10.1109\/SMC.2015.327"},{"key":"914_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.neucom.2012.12.048","volume":"113","author":"X Yang","year":"2013","unstructured":"Yang X, Yu Q, He L, Guo T (2013) The one-against-all partition based binary tree support vector machine algorithms for multi-class classification. Neurocomputing 113:1\u20137","journal-title":"Neurocomputing"},{"issue":"2","key":"914_CR29","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1137\/140977680","volume":"8","author":"Y Aflalo","year":"2015","unstructured":"Aflalo Y, Brezis H, Kimmel R (2015) On the optimality of shape and data representation in the spectral domain. SIAM J Imaging Sci 8(2):1141\u20131160","journal-title":"SIAM J Imaging Sci"},{"issue":"10","key":"914_CR30","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1109\/TPAMI.2015.2400461","volume":"37","author":"Z Li","year":"2015","unstructured":"Li Z, Liu J, Tang J (2015) Robust Structured Subspace Learning for Data Representation. IEEE Trans Pattern Anal Mach Intell 37(10):2085\u20132098","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"914_CR31","unstructured":"Krylov AN (1931) On the numerical solution of equations whose solution determine the frequency of small vibrations of material systems"},{"issue":"2","key":"914_CR32","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/mrm.20965","volume":"56","author":"V Arsigny","year":"2006","unstructured":"Arsigny V, Fillard P, Pennec X, Ayache N (2006) Log-Euclidean Metrics for Fast and Simple Calculus on Diffusion Tensors. Magn Reson Med 56(2):411\u2013421","journal-title":"Magn Reson Med"},{"key":"914_CR33","unstructured":"Van Loan CF, Golub GH (1996) Matrix Computations, Third ed. Johns Hopkins Univ Press"},{"key":"914_CR34","unstructured":"Foggia P, Sansone C, Vento M (2001) A Database of Graphs for Isomorphism and Subgraph Isomorphism Benchmarking. Proc Third IAPR TC-15 Int\u2019l Workshop Graph-Based Represent Patt Recogn 176\u2013187"},{"key":"914_CR35","doi-asserted-by":"crossref","unstructured":"Riesen K, Bunke H (2008) IAM graph database repository for graph based pattern recognition and machine learning. SSPR","DOI":"10.1007\/978-3-540-89689-0_33"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-017-0914-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-017-0914-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-017-0914-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T09:40:44Z","timestamp":1570095644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-017-0914-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,10]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["914"],"URL":"https:\/\/doi.org\/10.1007\/s11036-017-0914-x","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,10]]},"assertion":[{"value":"10 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}