{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T18:09:15Z","timestamp":1774548555579,"version":"3.50.1"},"reference-count":77,"publisher":"Oxford University Press (OUP)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcomplexnetw"],"DOI":"10.1093\/comnet\/cnw016","type":"journal-article","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T00:09:49Z","timestamp":1470355789000},"page":"cnw016","source":"Crossref","is-referenced-by-count":11,"title":["A graph spectral-based scoring scheme for network comparison"],"prefix":"10.1093","author":[{"given":"Vasundhara","family":"Gadiyaram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sambit","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saraswathi","family":"Vishveshwara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,8,3]]},"reference":[{"key":"2016080417093842000_cnw016v1.1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"2016080417093842000_cnw016v1.2","doi-asserted-by":"crossref","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., 18, 1450001.","DOI":"10.1142\/S0218001414500013"},{"key":"2016080417093842000_cnw016v1.3","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","article-title":"Finding all cliques of an undirected graph (algorithm 457)","volume":"18","author":"Bron,","year":"(1973)","journal-title":"Commun. ACM,"},{"key":"2016080417093842000_cnw016v1.4","doi-asserted-by":"crossref","unstructured":"Cordella, L. P., Foggia, P., Sansone, C., Tortorella, F. & Vento, M. (1998) Graph matching: a fast algorithm and its evaluation. Proceedings of the Fourteenth International Conference on Pattern Recognition. IEEE, pp. 1582\u20131584.","DOI":"10.1109\/ICPR.1998.712014"},{"key":"2016080417093842000_cnw016v1.5","unstructured":"Cordella, L. P., Foggia, P., Sansone, C. & Vento, M. (2001) An improved algorithm for matching large graphs. Third IAPR-TC15 Workshop on Graph-Based Representations in Pattern Recognition, Brisbane, Australia. Citeseer, pp. 149\u2013159."},{"key":"2016080417093842000_cnw016v1.6","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1980.4308468"},{"key":"2016080417093842000_cnw016v1.7","doi-asserted-by":"crossref","unstructured":"Hopcroft, J. E. & Wong, J.-K. (1974) Linear time algorithm for isomorphism of planar graphs (preliminary report). Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, Illinois, Chigao, USA. ACM, pp. 172\u2013184.","DOI":"10.1145\/800119.803896"},{"key":"2016080417093842000_cnw016v1.8","unstructured":"Irniger, C. & Bunke, H. (2001) Graph matching: filtering large databases of graphs using decision trees. IAPR-TC15 Workshop on Graph-Based Representation in Pattern Recognition, pp. 239\u2013249."},{"key":"2016080417093842000_cnw016v1.9","doi-asserted-by":"crossref","unstructured":"Luks, E. M. (1980) Isomorphism of graphs of bounded valence can be tested in polynomial time. Twenty-First Annual Symposium on Foundations of Computer Science. IEEE, pp. 42\u201349.","DOI":"10.1109\/SFCS.1980.24"},{"key":"2016080417093842000_cnw016v1.10","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380120103"},{"key":"2016080417093842000_cnw016v1.11","doi-asserted-by":"publisher","DOI":"10.1109\/69.842269"},{"key":"2016080417093842000_cnw016v1.12","doi-asserted-by":"crossref","unstructured":"Pardalos, P. M., Rappe, J. & Resende, M. G. (1998) An exact parallel algorithm for the maximum clique problem. High Performance Algorithms and Software in Nonlinear Optimization, De Leone, R. Murli, A. Pardalos P.M. & Toraldo, G. , Springer, pp. 279\u2013300.","DOI":"10.1007\/978-1-4613-3279-4_18"},{"key":"2016080417093842000_cnw016v1.13","doi-asserted-by":"crossref","unstructured":"Shearer, K., Bunke, H., Venkatesh, S. & Kieronska, D. (1998) Efficient Graph Matching for Video Indexing. Vienna: Springer.","DOI":"10.1007\/978-3-7091-6487-7_6"},{"key":"2016080417093842000_cnw016v1.14","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"2016080417093842000_cnw016v1.15","doi-asserted-by":"crossref","unstructured":"Branca, A., Stella, E. & Distante, A. (1999) Feature matching by searching maximum clique on high order association graph. Proceedings of the International Conference on Image Analysis and Processing. IEEE, pp. 642\u2013658.","DOI":"10.1109\/ICIAP.1999.797669"},{"key":"2016080417093842000_cnw016v1.16","doi-asserted-by":"crossref","unstructured":"Cordella, L. P., Foggia, P., Sansone, C. & Vento, M. (1998) Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs. Vienna: Springer.","DOI":"10.1007\/978-3-7091-6487-7_5"},{"key":"2016080417093842000_cnw016v1.17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/T-C.1973.223602","article-title":"The representation and matching of pictorial structures","volume":"18","author":"Fischler,","year":"(1973)","journal-title":"IEEE Transactions on Computers"},{"key":"2016080417093842000_cnw016v1.18","doi-asserted-by":"publisher","DOI":"10.1142\/S021800148900005X"},{"key":"2016080417093842000_cnw016v1.19","first-page":"313","article-title":"Relaxation labeling networks for the maximum clique problem","volume":"2","author":"Pelillo,","year":"(1995)","journal-title":"J. Artif. Neural Netw.,"},{"key":"2016080417093842000_cnw016v1.20","doi-asserted-by":"crossref","unstructured":"Sanfeliu, A. & Fu, K.-S. (1983) A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern., 353\u2013362.","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"2016080417093842000_cnw016v1.21","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","article-title":"Structural descriptions and inexact matching","volume":"18","author":"Shapiro,","year":"(1981)","journal-title":"IEEE Trans Pattern Anal. Machine Intell.,"},{"key":"2016080417093842000_cnw016v1.22","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TSMC.1983.6313029","article-title":"Subgraph error-correcting isomorphisms for syntactic pattern recognition","volume":"18","author":"Tsai,","year":"(1983)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"2016080417093842000_cnw016v1.23","doi-asserted-by":"publisher","DOI":"10.1109\/21.57275"},{"key":"2016080417093842000_cnw016v1.24","unstructured":"Brand, M. & Huang, K. (2003) A unifying theorem for spectral embedding and clustering. Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, Key West, Florida."},{"key":"2016080417093842000_cnw016v1.25","unstructured":"Butler, S. & Chung, F. (2006) Spectral graph theory. Handbook of Linear Algebra, L. Hogben, e., Florida: CRC Press, pp. 47."},{"key":"2016080417093842000_cnw016v1.26","doi-asserted-by":"crossref","unstructured":"Carcassoni, M. & Hancock, E. R. (2001) Weighted graph-matching using modal clusters. Computer Analysis of Images and Patterns. Skarbek, W. ed, Heidelberg, Berlin: Springer, pp. 142\u2013151.","DOI":"10.1007\/3-540-44692-3_18"},{"key":"2016080417093842000_cnw016v1.27","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler,","year":"(1973)","journal-title":"Czech. Math. J.,"},{"key":"2016080417093842000_cnw016v1.28","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"2016080417093842000_cnw016v1.29","doi-asserted-by":"crossref","unstructured":"Kosinov, S. & Caelli, T. (2002) Inexact multisubgraph matching using graph eigenspace and clustering models. Structural, Syntactic, and Statistical Pattern Recognition, Caelli, T. Amin, A. Duin, R. P.W. de Ridder D. & Kamel, M. eds, Heidelberg, Berlin: Springer, pp. 133\u2013142.","DOI":"10.1007\/3-540-70659-3_13"},{"key":"2016080417093842000_cnw016v1.30","doi-asserted-by":"crossref","unstructured":"Lee, W.-J. & Duin, R. P. (2008) An inexact graph comparison approach in joint eigenspace. Structural, Syntactic, and Statistical Pattern Recognition, da Vitoria Lobo, N. Kasparis, T. Roli, F. Kwok, JT Georgiopoulos, M. Anagnostopoulos G.C. & Loog, M. eds, Heidelberg, Berlin: Springer, pp. 35\u201344.","DOI":"10.1007\/978-3-540-89689-0_8"},{"key":"2016080417093842000_cnw016v1.31","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.09.005"},{"key":"2016080417093842000_cnw016v1.32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"2016080417093842000_cnw016v1.33","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"2016080417093842000_cnw016v1.34","doi-asserted-by":"crossref","unstructured":"van Leuken, R. H., Symonova, O., Veltkamp, R. C. & de Amicis, R. (2008) Complex Fiedler vectors for shape retrieval. Structural, Syntactic, and Statistical Pattern Recognition, da Vitoria Lobo, N. Kasparis, T. Roli, F. Kwok, JT Georgiopoulos, M. Anagnostopoulos G.C. & Loog, M. eds, Heidelberg, Berlin: Springer, pp, 167\u2013176.","DOI":"10.1007\/978-3-540-89689-0_21"},{"key":"2016080417093842000_cnw016v1.35","doi-asserted-by":"publisher","DOI":"10.1109\/3477.956043"},{"key":"2016080417093842000_cnw016v1.36","doi-asserted-by":"crossref","unstructured":"Zhu, P. & Wilson, R. C. (2005) A study of graph spectra for comparing graphs. proceeding for British Machine Vision Conference, Clocksin, U.K.W. Fitzgibbon A. & Torr, P. eds.","DOI":"10.5244\/C.19.69"},{"key":"2016080417093842000_cnw016v1.37","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2011.11.004"},{"key":"2016080417093842000_cnw016v1.38","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2008.07.032"},{"key":"2016080417093842000_cnw016v1.39","doi-asserted-by":"publisher","DOI":"10.1145\/1710115.1710129"},{"key":"2016080417093842000_cnw016v1.40","doi-asserted-by":"crossref","first-page":"046109","DOI":"10.1103\/PhysRevE.66.046109","article-title":"Evolutionary reconstruction of networks","volume":"66","author":"Ipsen,","year":"(2002)","journal-title":"Physical Review E"},{"key":"2016080417093842000_cnw016v1.41","doi-asserted-by":"crossref","first-page":"450","DOI":"10.21914\/anziamj.v48i0.62","article-title":"Detecting changes in time series of network graphs using minimum mean squared error and cumulative summation","volume":"48","author":"Pincombe,","year":"(2007)","journal-title":"ANZIAM J.,"},{"key":"2016080417093842000_cnw016v1.42","doi-asserted-by":"crossref","unstructured":"Jurman, G., Visintainer, R., Filosi, M., Riccadonna, S. & Furlanello, C. (2015) The HIM glocal metric and kernel for network comparison and classification. IEEE International Conference on Data Science and Advanced Analytics (DSAA), Paris. 36678 2015. IEEE, pp. 1\u201310.","DOI":"10.1109\/DSAA.2015.7344816"},{"key":"2016080417093842000_cnw016v1.43","unstructured":"Jurman, G., Visintainer, R. & Furlanello, C. (2010) An introduction to spectral distances in networks (extended version). Preprint arXiv:1005.0103."},{"key":"2016080417093842000_cnw016v1.44","unstructured":"Butler, S. (2015) Algebraic aspects of the normalized Laplacian. Recent Trends in Combinatorics. The IMA Volumes in Mathematics and its Applications, IMA (2016). Beveridge, A. Griggs, JR Hogben, L. Musiker G. & Tetali, P. Switzerland: Springer International Publishing. 295\u2013316."},{"key":"2016080417093842000_cnw016v1.45","unstructured":"Chung, F. R. (1997) Spectral Graph Theory, Vol. 92. USA: American Mathematical Society."},{"key":"2016080417093842000_cnw016v1.46","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"2016080417093842000_cnw016v1.47","unstructured":"Zumstein, P. (2005) Comparison of spectral methods through the adjacency matrix and the Laplacian of a graph. Diploma Thesis, ETH Z\u00fcrich."},{"key":"2016080417093842000_cnw016v1.48","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2004.10.022"},{"key":"2016080417093842000_cnw016v1.49","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1265866"},{"key":"2016080417093842000_cnw016v1.50","doi-asserted-by":"publisher","DOI":"10.1098\/rspb.1991.0045"},{"key":"2016080417093842000_cnw016v1.51","doi-asserted-by":"publisher","DOI":"10.1016\/0262-8856(92)90043-3"},{"key":"2016080417093842000_cnw016v1.52","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2008.01.029"},{"key":"2016080417093842000_cnw016v1.53","doi-asserted-by":"crossref","unstructured":"Gould, P. R. (1967) On the geographical interpretation of eigenvalues. Trans. Inst. Br. Geogr., 53\u201386.","DOI":"10.2307\/621372"},{"key":"2016080417093842000_cnw016v1.54","doi-asserted-by":"publisher","DOI":"10.1529\/biophysj.104.051508"},{"key":"2016080417093842000_cnw016v1.55","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2004.08.046"},{"key":"2016080417093842000_cnw016v1.56","doi-asserted-by":"publisher","DOI":"10.1529\/biophysj.105.064485"},{"key":"2016080417093842000_cnw016v1.57","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmb.2003.08.061"},{"key":"2016080417093842000_cnw016v1.58","doi-asserted-by":"crossref","unstructured":"Vendruscolo, M., Dokholyan, N. V., Paci, E. & Karplus, M. (2002) Small-world view of the amino acids that play a key role in protein folding. Physical Review E, 65, 061910.","DOI":"10.1103\/PhysRevE.65.061910"},{"key":"2016080417093842000_cnw016v1.59","doi-asserted-by":"publisher","DOI":"10.1016\/j.pharmthera.2013.01.016"},{"key":"2016080417093842000_cnw016v1.60","doi-asserted-by":"publisher","DOI":"10.1038\/35054591"},{"key":"2016080417093842000_cnw016v1.61","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20140"},{"key":"2016080417093842000_cnw016v1.62","doi-asserted-by":"publisher","DOI":"10.1515\/REVCE.1999.15.4.319"},{"key":"2016080417093842000_cnw016v1.63","doi-asserted-by":"publisher","DOI":"10.1039\/c3mb70157c"},{"key":"2016080417093842000_cnw016v1.64","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1993.1074"},{"key":"2016080417093842000_cnw016v1.65","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1999.3058"},{"key":"2016080417093842000_cnw016v1.66","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(90)90312-A"},{"key":"2016080417093842000_cnw016v1.67","doi-asserted-by":"publisher","DOI":"10.1110\/ps.24701"},{"key":"2016080417093842000_cnw016v1.68","doi-asserted-by":"publisher","DOI":"10.1016\/S1093-3263(00)00122-4"},{"key":"2016080417093842000_cnw016v1.69","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1002\/prot.20532","article-title":"A graph spectral analysis of the structural similarity network of protein chains","volume":"61","author":"Krishnadev,","year":"(2005)","journal-title":"Proteins,"},{"key":"2016080417093842000_cnw016v1.70","unstructured":"Livi, L., Maiorino, E., Pinna, A., Sadeghian, A., Rizzi, A. & Giuliani, A. (2014) Analysis of heat kernel highlights the strongly modular and heat-preserving structure of proteins. Preprint arXiv:1409.1819."},{"key":"2016080417093842000_cnw016v1.71","doi-asserted-by":"publisher","DOI":"10.1002\/prot.20444"},{"key":"2016080417093842000_cnw016v1.72","doi-asserted-by":"crossref","first-page":"4","DOI":"10.2174\/1389203716666150923105727","article-title":"Protein structure and function: looking through the network of side-chain interactions","volume":"17","author":"Bhattacharyya,","year":"(2016)","journal-title":"Curr. Protein Peptide Sci.,"},{"key":"2016080417093842000_cnw016v1.73","doi-asserted-by":"crossref","unstructured":"Chakrabarti, G. & Sen, C. (2013) Momentum Trading on the Indian Stock Market. India: Springer.","DOI":"10.1007\/978-81-322-1127-3"},{"key":"2016080417093842000_cnw016v1.74","unstructured":"Manda, K. (2010) Stock Market Volatility during the 2008 Financial Crisis. Citeseer. New York: New York University."},{"key":"2016080417093842000_cnw016v1.75","first-page":"1348","article-title":"Visualizing the indian stock market: a complex networks approach","volume":"6","author":"Rehan,","year":"(2013)","journal-title":"Int. J. Adv. Eng. Technol.,"},{"key":"2016080417093842000_cnw016v1.76","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, M., Upadhyay, R. & Vishveshwara, S. (2012) Interaction signatures stabilizing the nad (p)-binding rossmann fold: a structure network approach. PLoS One, 7, e51676.","DOI":"10.1371\/journal.pone.0051676"},{"key":"2016080417093842000_cnw016v1.77","doi-asserted-by":"publisher","DOI":"10.1016\/j.bpj.2009.07.016"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/5\/2\/219\/11204920\/cnw016.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T00:10:31Z","timestamp":1656979831000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article-lookup\/doi\/10.1093\/comnet\/cnw016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,3]]},"references-count":77,"alternative-id":["10.1093\/comnet\/cnw016"],"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnw016","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,3]]}}}