{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:29:53Z","timestamp":1725470993820},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540448945"},{"type":"electronic","value":"9783540448969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11867661_34","type":"book-chapter","created":{"date-parts":[[2006,9,20]],"date-time":"2006-09-20T09:08:20Z","timestamp":1158743300000},"page":"375-385","source":"Crossref","is-referenced-by-count":1,"title":["Spanning Trees from the Commute Times of Random Walks on Graphs"],"prefix":"10.1007","author":[{"given":"Huaijun","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\u20137","key":"34_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems\u00a030(1\u20137), 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral Graph Theory. In: American Mathmatical Society (Ed.). CBMS series, vol.\u00a092 (1997)","DOI":"10.1090\/cbms\/092"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K., Yau, S.-T.: Discrete green\u2019s functions. J. Combin. Theory Ser., 191\u2013214 (2000)","DOI":"10.1006\/jcta.2000.3094"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Gori, M., Maggini, M., Sarti, L.: Graph matching using random walks. In: ICPR 2004, pp. III: 394\u2013397 (2004)","DOI":"10.1109\/ICPR.2004.1334549"},{"key":"34_CR5","unstructured":"Kondor, R., Lafferty, J.: Diffusion kernels on graphs and other discrete structures. In: 19th Intl. Conf. on Machine Learning (ICML) [ICM02]. (2002)"},{"key":"34_CR6","first-page":"353","volume":"2","author":"L. Lov\u00e1sz","year":"1996","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: A survey. Combinatorics, Paul Erds is eighty\u00a02, 353\u2013397 (1996)","journal-title":"Combinatorics, Paul Erds is eighty"},{"issue":"10","key":"34_CR7","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B. Luo","year":"2001","unstructured":"Luo, B., Hancock, E.R.: Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI\u00a023(10), 1120\u20131136 (2001)","journal-title":"IEEE PAMI"},{"key":"34_CR8","unstructured":"Meila, M., Shi, J.: A random walks view of spectral segmentation. In: NIPS, pp. 873\u2013879 (2000)"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1162\/089976699300016034","volume":"11","author":"M. Pelillo","year":"1999","unstructured":"Pelillo, M.: Replicator equations, maximal cliques, and graph isomorphism. Neural Computation\u00a011, 1933\u20131955 (1999)","journal-title":"Neural Computation"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1109\/ICIAP.1999.797759","volume-title":"ICIAP 1999-10th Int. Conf. on Image Analysis and Processing","author":"M. Pelillo","year":"1999","unstructured":"Pelillo, M., Siddiqi, K., Zucker, S.W.: Attributed tree matching and maximum weight cliques. In: ICIAP 1999-10th Int. Conf. on Image Analysis and Processing, pp. 1154\u20131159. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"34_CR11","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalisations. The Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"The Bell System Technical Journal"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-24673-2_10","volume-title":"Computer Vision - ECCV 2004","author":"H. Qiu","year":"2004","unstructured":"Qiu, H., Hancock, E.R.: Spectral simplification of graphs. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol.\u00a03024, pp. 114\u2013126. Springer, Heidelberg (2004)"},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A. Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.R.: Graph edit distance from spectral seriation. IEEE TPAMI\u00a027, 365\u2013378 (2005)","journal-title":"IEEE TPAMI"},{"key":"34_CR14","first-page":"315","volume":"18","author":"A. Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.R.: String edit distance, random walks and graph matching. IJPRAI\u00a018, 315\u2013327 (2005)","journal-title":"IJPRAI"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-30115-8_35","volume-title":"Machine Learning: ECML 2004","author":"M. Saerens","year":"2004","unstructured":"Saerens, M., Fouss, F., Yen, L., Dupont, P.E.: The principal components analysis of a graph, and its relationships to spectral clustering. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS, vol.\u00a03201, pp. 371\u2013383. Springer, Heidelberg (2004)"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Sood, V., Redner, S., ben-Avraham, D.: First-passage properties of the erdoscrenyi random graph. J. Phys. A: Math. Gen., 109\u2013123 (2005)","DOI":"10.1088\/0305-4470\/38\/1\/007"},{"key":"34_CR17","unstructured":"Torsello, A., Hancock, E.R.: Computing approximate tree edit distance using relaxation labelling. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 125\u2013136 (2001)"}],"container-title":["Lecture Notes in Computer Science","Image Analysis and Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11867661_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:46:27Z","timestamp":1605642387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11867661_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540448945","9783540448969"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11867661_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}