{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:11:59Z","timestamp":1725563519047},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642149795"},{"type":"electronic","value":"9783642149801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14980-1_27","type":"book-chapter","created":{"date-parts":[[2010,8,28]],"date-time":"2010-08-28T10:05:23Z","timestamp":1282989923000},"page":"286-295","source":"Crossref","is-referenced-by-count":5,"title":["What Is the Complexity of a Network? The Heat Flow-Thermodynamic Depth Approach"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Escolano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Giorgi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"27_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2008.06.033","volume":"157","author":"A. Banerjee","year":"2009","unstructured":"Banerjee, A., Jost, J.: Graph Spectra as a Systematic Tool in Computational Biology. Discrete Applied Mathematics\u00a0157(10), 27\u201340 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1209\/epl\/i2005-10441-3","volume":"73","author":"E. Estrada","year":"2006","unstructured":"Estrada, E.: Spectral Scaling and Good Expansion Properties in Complex Networks. Europhys. Lett.\u00a073(4), 649 (2006)","journal-title":"Europhys. Lett."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Escolano, F., Hancock, E.R., Lozano, M.A.: Birkhoff Polytopes, Heat kernels and Graph complexity. In: Proc. of ICPR, pp. 1\u20135 (2008)","DOI":"10.1109\/ICPR.2008.4761921"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Escolano, F., Giorgi, D., Hancock, E.R., Lozano, M.A., Falcidieno, B.: Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering. In: Proc. of GbRPR, pp. 253\u2013262 (2009)","DOI":"10.1007\/978-3-642-02124-4_26"},{"key":"27_CR5","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":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-92185-1_21","volume-title":"Internet and Network Economics","author":"S. Agrawal","year":"2008","unstructured":"Agrawal, S., Wang, Z., Ye, Y.: Parimutuel Betting on Permuations. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 126\u2013137. Springer, Heidelberg (2008)"},{"issue":"4","key":"27_CR7","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":"27_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/11564096_65","volume-title":"Machine Learning: ECML 2005","author":"R. Nock","year":"2005","unstructured":"Nock, R., Nielsen, F.: Fitting Smallest Enclosing Bregman Ball. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol.\u00a03720, pp. 649\u2013656. Springer, Heidelberg (2005)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Tsang, I.W., Kocsor, A., Kwok, J.T.: Simple Core Vector Machines with Enclosing Balls. In: Proc. of ICLM, pp. 911\u2013918 (2007)","DOI":"10.1145\/1273496.1273611"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Cayton, L.: Fast Nearest Neighbor Retrival with Bregman Divergences. In: Proc. of ICLM, pp. 112\u2013119 (2008)","DOI":"10.1145\/1390156.1390171"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1068\/a211541","volume":"21","author":"P.B. Slater","year":"1989","unstructured":"Slater, P.B.: Maximum-Entropy Representations in Convex Polytopes. Env. and Planning\u00a021, 1541\u20131546 (1989)","journal-title":"Env. and Planning"}],"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-642-14980-1_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:00:00Z","timestamp":1606186800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14980-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642149795","9783642149801"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14980-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}