{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:52:22Z","timestamp":1794516742660,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":17,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_228","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:06Z","timestamp":1461268986000},"page":"1211-1215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Max Leaf Spanning Tree"],"prefix":"10.1007","author":[{"given":"Frances","family":"Rosamond","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"228_CR1397","volume-title":"Spanning trees with many leaves: new extremal results and an improved FPT algorithm","author":"P Bonsma","year":"2006","unstructured":"Bonsma P (2006) Spanning trees with many leaves: new extremal results and an improved FPT algorithm, vol 1793. Memorandum Department of Applied Mathematics, University of Twente, Enschede"},{"key":"228_CR1398","doi-asserted-by":"crossref","unstructured":"Bonsma P, Brueggemann T, Woeginger G (2003) A faster FPT algorithm for finding spanning trees with many leaves. In: Proceedings of MFCS 2003. Lecture notes in computer science, vol 2747. Springer, Berlin, pp 259\u2013268","DOI":"10.1007\/978-3-540-45138-9_20"},{"key":"228_CR1399","series-title":"Monographs in computer science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey RG, Fellows MR (1999) Parameterized complexity, Monographs in computer science. Springer, New York"},{"key":"228_CR13100","doi-asserted-by":"crossref","unstructured":"Dehne F, Fellows M, Langston M, Rosamond F, Stevens K (2005) An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem. In: Proceedings COCOON 2005. Lecture notes in computer science, vol 3595. Springer, Berlin, pp 859\u2013869","DOI":"10.1007\/11533719_87"},{"issue":"6","key":"228_CR13101","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/s00371-006-0018-2","volume":"22","author":"P Diaz-Gutierrez","year":"2006","unstructured":"Diaz-Gutierrez P, Bhushan A, Gopi M, Pajarola R (2006) Single-strips for fast interactive rendering. J Vis Comput 22(6):372\u2013386","journal-title":"J Vis Comput"},{"key":"228_CR13102","unstructured":"Dutta R, Savage C (2005) A Note on the complexity of converter placement supporting broadcast in WDM optical networks. In: Proceedings of the international conference on telecommunication systems-modeling and analysis, Dallas, Nov 2005, pp 23\u201331. ISBN: 0-9716253-3-6. American Telecommunication Systems Management Association, Nashville"},{"key":"228_CR13103","unstructured":"Egecioglu O, Gonzalez T (2001) Minimum-energy broadcast in simple graphs with limited node power. In: Proceedings of the IASTED international conference on parallel and distributed computing and systems (PDCS), Anaheim, Aug 2001, pp 334\u2013338"},{"key":"228_CR13104","unstructured":"Estivill-Castro V, Fellows MR, Langston MA, Rosamond FA (2005) FPT is P-time extremal structure I. In: Algorithms and complexity in Durham 2005. Texts in algorithmics, vol 4. Kings College Publications, London, pp 1\u201341"},{"key":"228_CR13105","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/0405010","volume":"5","author":"M Fellows","year":"1992","unstructured":"Fellows M, Langston M (1992) On well-partial-order theory and its applications to combinatorial problems of VLSI design. SIAM J Discret Math 5:117\u2013126","journal-title":"SIAM J Discret Math"},{"key":"228_CR13106","doi-asserted-by":"crossref","unstructured":"Fellows M (2003) Blow-ups, win\/win's and crown rules: some new directions in FPT. In: Proceedings of the 29th workshop on graph theoretic concepts in computer science (WG 2003). Lecture notes in computer science, vol 2880. Springer, Berlin, pp 1\u201312","DOI":"10.1007\/978-3-540-39890-5_1"},{"key":"228_CR13107","doi-asserted-by":"crossref","unstructured":"Fellows M, McCartin C, Rosamond F, Stege U (2000) Coordinatized kernels and catalytic reductions: an improved FPT algorithm for max leaf spanning tree and other problems. In: Proceedings of the 20th conference on foundations of software technology and theoretical computer science (FST-TCS 2000). Lecture notes in theoretical computer science, vol 1974. Springer, Berlin, pp 240\u2013251","DOI":"10.1007\/3-540-44450-5_19"},{"key":"228_CR13108","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"DJ Kleitman","year":"1991","unstructured":"Kleitman DJ, West DB (1991) Spanning trees with many leaves. SIAM J Discret Math 4:99\u2013106","journal-title":"SIAM J Discret Math"},{"key":"228_CR13109","first-page":"57","volume":"8","author":"M Kouider","year":"2006","unstructured":"Kouider M, Vestergaard PD (2006) Generalized connected domination in graphs. Discret Math Theory Comput Sci (DMTCS) 8:57\u201364","journal-title":"Discret Math Theory Comput Sci (DMTCS)"},{"key":"228_CR13110","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/jagm.1998.0944","volume":"29","author":"H-I Lu","year":"1998","unstructured":"Lu H-I, Ravi R (1998) Approximating maximum leaf spanning trees in almost linear time. J Algorithm 29:132\u2013141","journal-title":"J Algorithm"},{"key":"228_CR13111","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed parameter algorithms. Lecture series in mathematics and its applications","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier R (2006) Invitation to fixed parameter algorithms. Lecture series in mathematics and its applications. Oxford University Press, Oxford"},{"key":"228_CR13112","unstructured":"Prieto-Rodriguez E (2005) Systematic kernelization in FPT algorithm design. Dissertation, School of Electrical Engineering and Computer Science, University of Newcastle"},{"key":"228_CR13113","doi-asserted-by":"crossref","unstructured":"Solis-Oba R (1998) 2-approximation algorithm for finding a spanning tree with the maximum number of leaves. In: Proceedings of the 6th annual European symposium on algorithms (ESA'98). Lecture notes in computer science, vol 1461. Springer, Berlin, pp 441\u2013452","DOI":"10.1007\/3-540-68530-8_37"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:55:12Z","timestamp":1792108512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_228","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}