{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:33:06Z","timestamp":1766136786473,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319509006"},{"type":"electronic","value":"9783319509013"}],"license":[{"start":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:00:00Z","timestamp":1480464000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-50901-3_17","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:02:04Z","timestamp":1480464124000},"page":"209-221","source":"Crossref","is-referenced-by-count":7,"title":["Graph Structure Similarity using Spectral Graph Theory"],"prefix":"10.1007","author":[{"given":"Brian","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Ralucca","family":"Gera","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"House","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Knuth","sequence":"additional","affiliation":[]},{"given":"Ryan","family":"Miller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,30]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aliakbary, S., Motallebi, S., Rashidian, S., Habibi, J., Movaghar, A.: Distance metric learning for complex networks: Towards size-independent comparison of network structures. Chaos: An Interdisciplinary Journal of Nonlinear Science 25(2), 023,111 (2015)","DOI":"10.1063\/1.4908605"},{"key":"17_CR2","unstructured":"Chartrand, G., Zhang, P.: A first course in graph theory. Courier Corporation (2012)"},{"key":"17_CR3","unstructured":"Chung, F.R.: Spectral graph theory, vol. 92. American Mathematical Soc. (1997)"},{"key":"17_CR4","unstructured":"Cunningham, D.: The boko haram network. [machine-readable data file]. https:\/\/sites.google.com\/site\/sfeverton18\/research\/appendix-1 (2014)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Cunningham, D., Everton, S., Wilson, G., Padilla, C., Zimmerman, D.: Brokers and key players in the internationalization of the farc. Studies in Conflict & Terrorism 36(6), 477\u2013502 (2013)","DOI":"10.1080\/1057610X.2013.784603"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Davis, B., Gera, R., Lazzaro, G., Lim, B.Y., Rye, E.C.: The marginal benefit of monitor placement on networks. In: Complex Networks VII, pp. 93\u2013104. Springer (2016)","DOI":"10.1007\/978-3-319-30569-1_7"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Frankl, P., R\u00f6dl, V.: Forbidden intersections. Transactions of the American Mathematical Society 300(1), 259\u2013286 (1987)","DOI":"10.1090\/S0002-9947-1987-0871675-6"},{"key":"17_CR8","unstructured":"Gera, R.: Network Discovery Visualization Project: Naval Postgraduate School network discovery visualization project. http:\/\/faculty.nps.edu\/dl\/networkVisualization\/ (2015)"},{"key":"17_CR9","unstructured":"Kashima, H., Inokuchi, A.: Kernels for graph classification. In: ICDM Workshop on Active Mining, vol. 2002. Citeseer (2002)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Klir, G., Elias, D.: Architecture of systems problem solving. 2nd edn., ifsr international series on systems science and engineering, vol. 21 (2003)","DOI":"10.1007\/978-1-4419-9224-6"},{"key":"17_CR11","unstructured":"Koutra, D., Vogelstein, J.T., Faloutsos, C.: Deltacon: A principled massive-graph similarity function"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Mihail, M., Papadimitriou, C.: On the eigenvalue power law. In: Randomization and approximation techniques in computer science, pp. 254\u2013262. Springer (2002)","DOI":"10.1007\/3-540-45726-7_20"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Pr\u017eulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), e177\u2013e183 (2007)","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"17_CR14","unstructured":"Roberts, N., Everton., S.F.: Terrorist data: Noordin top terrorist network (subset). [machinereadable data file]. https:\/\/sites.google.com\/site\/sfeverton18\/research\/appendix-1 (2011)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Ruth, D.M., Koyak, R.A.: Nonparametric tests for homogeneity based on non-bipartite matching. Journal of the American Statistical Association 106(496) (2011)","DOI":"10.1198\/jasa.2011.tm10576"},{"key":"17_CR16","unstructured":"Schmitt, K.: Fake degree discovery algorithm for lighting up networks. https:\/\/github.com\/Pelonza\/Graph Inference\/blob\/master (2015)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 737\u2013746. ACM (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Trefethen, L.N., Bau III, D.: Numerical linear algebra, vol. 50. Siam (1997)","DOI":"10.1137\/1.9780898719574"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Wilson, R.C., Zhu, P.: A study of graph spectra for comparing graphs and trees. Pattern Recognition 41(9), 2833\u20132841 (2008)","DOI":"10.1016\/j.patcog.2008.03.011"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Zager, L.A., Verghese, G.C.: Graph similarity scoring and matching. Applied mathematics letters 21(1), 86\u201394 (2008)","DOI":"10.1016\/j.aml.2007.01.006"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50901-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T22:55:53Z","timestamp":1568588153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50901-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,30]]},"ISBN":["9783319509006","9783319509013"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50901-3_17","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2016,11,30]]}}}