{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:57:08Z","timestamp":1725537428331},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_2","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"11-22","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks"],"prefix":"10.1007","author":[{"given":"Martin","family":"F\u00fcrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Cambridge Mathematical Library","volume-title":"Algebraic graph theory","author":"N. Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic graph theory, 2nd edn. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1993)","edition":"2"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02260499","volume":"35","author":"G. Tinhofer","year":"1985","unstructured":"Tinhofer, G., Schreck, H.: Computing the characteristic polynomial of a tree. Computing\u00a035(2), 113\u2013125 (1985)","journal-title":"Computing"},{"issue":"2,3","key":"2_CR3","first-page":"309","volume":"36","author":"W. Keller-Gehrig","year":"1985","unstructured":"Keller-Gehrig, W.: Fast algorithms for the characteristic polynomial. Theor.\u00a0Comput.\u00a0Sci.\u00a036(2,3), 309\u2013317 (1985)","journal-title":"Theor.\u00a0Comput.\u00a0Sci."},{"key":"2_CR4","series-title":"Grundlehren der Mathematischen Wissenschaften Fundamental Principles of Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic complexity theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic complexity theory. Grundlehren der Mathematischen Wissenschaften or Fundamental Principles of Mathematical Sciences, vol.\u00a0315. Springer, Berlin (1997); With the collaboration of Thomas Lickteig"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09(3), 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.13001\/1081-3810.1002","volume":"1","author":"G.H. Fricke","year":"1996","unstructured":"Fricke, G.H., Hedetniemi, S., Jacobs, D.P., Trevisan, V.: Reducing the adjacency matrix of a tree. Electron. J. Linear Algebra\u00a01, 34\u201343 (1996) (electronic)","journal-title":"Electron. J. Linear Algebra"},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF01169021","volume":"3","author":"B. Mohar","year":"1989","unstructured":"Mohar, B.: Computing the characteristic polynomial of a tree. J. Math. Chem.\u00a03(4), 403\u2013406 (1989)","journal-title":"J. Math. Chem."},{"key":"2_CR8","first-page":"213","volume":"54","author":"D.P. Jacobs","year":"2005","unstructured":"Jacobs, D.P., Machado, C.M.S., Trevison, V.: An $O(n\\sp 2)$ algorithm for the characteristic polynomial of a tree. J. Combin. Math. Combin. Comput.\u00a054, 213\u2013221 (2005)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"2_CR9","unstructured":"Ellis-Monaghan, J., Merino, C.: Graph polynomials and their applications ii: Interrelations and interpretations (2008)"},{"issue":"1-2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","volume":"108","author":"B. Courcelle","year":"2001","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl.\u00a0Math.\u00a0108(1-2), 23\u201352 (2001)","journal-title":"Discrete Appl.\u00a0Math."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/S0196-8858(02)00530-4","volume":"30","author":"J. Makowsky","year":"2003","unstructured":"Makowsky, J., Marino, J.: Farrell polynomials on graphs of bounded tree width. Advances in Applied Mathematics\u00a030, 160\u2013176 (2003)","journal-title":"Advances in Applied Mathematics"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11780342_35","volume-title":"Logical Approaches to Computational Barriers","author":"J.A. Makowsky","year":"2006","unstructured":"Makowsky, J.A.: From a zoo to a zoology: Descriptive complexity for graph polynomials. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 330\u2013341. Springer, Heidelberg (2006)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Bl\u00e4ser, M., Hoffmann, C.: Fast computation of interlace polynomials on graphs of bounded treewidth. CoRR abs\/0902.1693 (2009); 35 pages informal publication","DOI":"10.1007\/s00453-010-9439-4"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:09Z","timestamp":1558524129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}