{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:21:24Z","timestamp":1743142884202,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896883"},{"type":"electronic","value":"9783540896890"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89689-0_28","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T07:32:14Z","timestamp":1228116734000},"page":"237-246","source":"Crossref","is-referenced-by-count":7,"title":["Polytopal Graph Complexity, Matrix Permanents, and Embedding"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Escolano","sequence":"first","affiliation":[]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[]},{"given":"Miguel A.","family":"Lozano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Robles-Kelly, A., Hancock, E.R.: A riemannian approach to graph embedding. Pattern Recognition\u00a0(40), 1042\u20131056 (2007)","DOI":"10.1016\/j.patcog.2006.05.031"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Luo, B., Wilson, R.C., Hancock, E.: Spectral embedding of graphs. Pattern Recognition\u00a0(36), 2213\u20132223 (2003)","DOI":"10.1016\/S0031-3203(03)00084-0"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Shokoufandeh, A., Dickinson, S., Siddiqi, K., Zucker, S.: Indexing using a spectral encoding of topological structure. In: IEEE ICPR, pp. 491\u2013497","DOI":"10.1109\/CVPR.1999.784726"},{"issue":"6","key":"28_CR4","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TPAMI.2006.125","volume":"28","author":"A. Torsello","year":"2006","unstructured":"Torsello, A., Hancock, E.: Learning shape-classes using a mixture of tree-unions. IEEE Trans. on PAMI\u00a028(6), 954\u2013967 (2006)","journal-title":"IEEE Trans. on PAMI"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.patcog.2005.10.008","volume":"39","author":"M. Lozano","year":"2006","unstructured":"Lozano, M., Escolano, F.: Protein classification by matching and clustering surface graphs. Pattern Recognition\u00a039(4), 539\u2013551 (2006)","journal-title":"Pattern Recognition"},{"key":"28_CR6","unstructured":"K\u00f6rner, J.: Coding of an information source having ambiguous alphabet and the entropy of graphs. In: Trans. of the 6th Prague Conference on Information Theory, pp. 411\u2013425 (1973)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Escolano, F., Hancock, E., Lozano, M.: Birkhoff polytopes, heat kernels, and graph embedding. In: ICPR (2008)","DOI":"10.1109\/ICPR.2008.4761921"},{"key":"28_CR8","first-page":"147","volume":"5","author":"G.D. Birkhoff","year":"1946","unstructured":"Birkhoff, G.D.: Tres observaciones sobre el algebra lineal. Universidad Nacional de Tucuman Revista, Serie A\u00a05, 147\u2013151 (1946)","journal-title":"Universidad Nacional de Tucuman Revista, Serie A"},{"key":"28_CR9","unstructured":"Chang, C., Chen, W., Huang, H.: On service guarangees for input buffered crossbar switches: A capacity decomposition approach by birkhoff and von neumann. In: IEEE IWQoS, pp. 79\u201386 (1998)"},{"key":"28_CR10","unstructured":"Kondor, R.I., Lafferty, J.: Diffusion kernels on graphs and other discrete structures. In: Proc. ICML (2002)"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1090\/S0002-9939-1958-0095180-X","volume":"9","author":"L. Mirsky","year":"1958","unstructured":"Mirsky, L.: Proofs of two theorems on doubly stochastic matrices. Proc. Amer. Math. Soc.\u00a09, 371\u2013374 (1958)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"4","key":"28_CR12","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM\u00a051(4), 671\u2013697 (2004)","journal-title":"Journal of the ACM"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Qiu, H., Hancock, E.: Graph simplification and matching using conmute times. Pattern Recognition (40), 2874\u20132889 (2007)","DOI":"10.1016\/j.patcog.2006.11.013"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1093\/nar\/gkg034","volume":"31","author":"C. Mering von","year":"2003","unstructured":"von Mering, C., Huynen, M., Jaeggi, D., Schmidt, S., Bork, P., Snell, B.: String: a database of predicted functional associations. Nuc. Acid Res.\u00a031, 258\u2013261 (2003)","journal-title":"Nuc. Acid Res."}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89689-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:58:29Z","timestamp":1557943109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89689-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896883","9783540896890"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89689-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}