{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:29:29Z","timestamp":1725600569607},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642236716"},{"type":"electronic","value":"9783642236723"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23672-3_27","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T09:28:27Z","timestamp":1313141307000},"page":"219-227","source":"Crossref","is-referenced-by-count":0,"title":["Kernelising the Ihara Zeta Function"],"prefix":"10.1007","author":[{"given":"Furqan","family":"Aziz","sequence":"first","affiliation":[]},{"given":"Richard C.","family":"Wilson","sequence":"additional","affiliation":[]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"27_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H. Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Lett.\u00a018(8), 689\u2013694 (1997)","journal-title":"Pattern Recognition Lett."},{"key":"27_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","volume-title":"Learning Theory and Kernel Machines","author":"T. G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T., Flach, P., Wrobel, S.: On graph kernels: Hardness results and efficient alternatives. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT\/Kernel 2003. LNCS (LNAI), vol.\u00a02777, pp. 129\u2013143. Springer, Heidelberg (2003)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Borgwardt, M., Kriegel, H.: Shortest-path kernels on graphs. In: Proceedings of 5th IEEE Internationl Conference on Data Mining (ICDM 2005), pp. 74\u201381 (2005)","DOI":"10.1109\/ICDM.2005.132"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Qiangrong, J., Hualan, L., Yuan, G.: Cycle kernel based on spanning tree. In: Proc. of International Conference on Electrical and Control Engineering 2010, pp. 656\u2013659 (2010)","DOI":"10.1109\/iCECE.2010.167"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., G\u00e4rtner, T., Wrobel, S.: Cyclic pattern kernels for predictive graph mining. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery, pp. 158\u2013167 (2004)","DOI":"10.1145\/1014052.1014072"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Ren, P., Wilson, R.C., Hancock, E.R.: Pattern vectors from the Ihara zeta function. In: 19th International Conference on Pattern Recognition, pp. 1\u20134 (2008)","DOI":"10.1007\/978-3-540-89689-0_30"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-89689-0_30","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"P. Ren","year":"2008","unstructured":"Ren, P., Wilson, R.C., Hancock, E.R.: Graph Characteristics from the Ihara Zeta Function. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol.\u00a05342, pp. 257\u2013266. Springer, Heidelberg (2008)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-03767-2_45","volume-title":"Computer Analysis of Images and Patterns","author":"P. Ren","year":"2009","unstructured":"Ren, P., Aleksi\u0107, T., Wilson, R.C., Hancock, E.R.: Hypergraphs, Characteristic Polynomials and the Ihara Zeta Function. In: Jiang, X., Petkov, N. (eds.) CAIP 2009. LNCS, vol.\u00a05702, pp. 369\u2013376. Springer, Heidelberg (2009)"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.2140\/involve.2008.1.217","volume":"1","author":"G. Scott","year":"2008","unstructured":"Scott, G., Storm, C.K.: The coefficients of the Ihara Zeta Function. Involve - a Journal of Mathematics\u00a01(2), 217\u2013233 (2008)","journal-title":"Involve - a Journal of Mathematics"},{"key":"27_CR10","unstructured":"Kotani, M., Sunada, T.: Zeta function of finite graphs. Journal of Mathematics, University of Tokyo 7(1), 7\u201325 (200)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Brooks, B.P.: The coefficients of the characteristic polynomial in terms of the eigenvalues and the elements of an n\u00d7n matrix. Applied Mathematics, 511\u2013515 (2006)","DOI":"10.1016\/j.aml.2005.07.007"},{"key":"27_CR12","unstructured":"Mihoubi, M.: Some congruences for the partial Bell polynomials Journal of Integer Sequences (2009)"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0024-3795(01)00318-4","volume":"336","author":"H. Mizuno","year":"2001","unstructured":"Mizuno, H., Sato, I.: Zeta functions of diagraphs. Linear Algebra and its Applications\u00a0336, 181\u2013190 (2001)","journal-title":"Linear Algebra and its Applications"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Ren, P., Aleksic, T., Emms, D., Wilson, R.C., Hancock, E.R.: Quantum walks, Ihara zeta functions and cospectrality in regular graphs. Quantum Information Processing (in press)","DOI":"10.1007\/s11128-010-0205-y"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Bass, H.: The IharaSelberg zeta function of a tree lattice. Internat. J. Math, 717\u2013797 (1992)","DOI":"10.1142\/S0129167X92000357"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput., 950\u2013959 (2009)","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Harris, C., Stephens, M.: A combined corner and edge detector. In: Fourth Alvey Vision Conference, Manchester, UK, pp. 147\u2013151 (1988)","DOI":"10.5244\/C.2.23"}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23672-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T18:01:20Z","timestamp":1686247280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23672-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642236716","9783642236723"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23672-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}