{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:33:44Z","timestamp":1794357224206,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_228","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:35:29Z","timestamp":1214490929000},"page":"511-514","source":"Crossref","is-referenced-by-count":0,"title":["Max Leaf Spanning Tree"],"prefix":"10.1007","author":[{"given":"Frances","family":"Rosamond","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"228_CR1_228","unstructured":"Bonsma, P.: Spanning trees with many leaves: new extremal results and an improved FPT algorithm. Memorandum Department of Applied Mathematics, vol.\u00a01793, University of Twente, Enschede (2006)"},{"key":"228_CR2_228","volume-title":"A faster FPT algorithm for finding spanning trees with many leaves. Proceedings of MFCS 2003. Lecture Notes in Computer Science, vol. 2747, pp. 259\u2013268","author":"P. Bonsma","year":"2003","unstructured":"Bonsma, P., Brueggemann, T., Woeginger, G.: A\u00a0faster FPT algorithm for finding spanning trees with many leaves. Proceedings of MFCS 2003. Lecture Notes in Computer Science, vol.\u00a02747, pp. 259\u2013268. Springer, Berlin (2003)"},{"key":"228_CR3_228","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity. Monographs in Computer Science","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"228_CR4_228","volume-title":"An $$ { O(2^{O(k)}n^{3}) } $$ FPT algorithm for the undirected feedback vertex set problem. Proceedings COCOON 2005. Lecture Notes in Computer Science, vol. 3595, pp. 859\u2013869","author":"F. Dehne","year":"2005","unstructured":"Dehne, F., Fellows, M., Langston, M., Rosamond, F., Stevens, K.: An $$ { O(2^{O(k)}n^{3}) } $$ FPT algorithm for the undirected feedback vertex set problem. Proceedings COCOON 2005. Lecture Notes in Computer Science, vol.\u00a03595, pp. 859\u2013869. Springer, Berlin (2005)"},{"issue":"6","key":"228_CR5_228","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/s00371-006-0018-2","volume":"22","author":"P. Diaz\u2010Gutierrez","year":"2006","unstructured":"Diaz\u2010Gutierrez, P., Bhushan, A., Gopi, M., Pajarola, R.: Single\u2010strips for fast interactive rendering. J.\u00a0Vis. Comput. 22(6), 372\u2013386 (2006)","journal-title":"J. Vis. Comput."},{"key":"228_CR6_228","unstructured":"Dutta, R., Savage, C.: A\u00a0Note on the Complexity of Converter Placement Supporting Broadcast in WDM Optical Networks. In: Proceedings of the International Conference on Telecommunication Systems\u2010Modeling and Analysis, Dallas, November 2005 ISBN: 0-9716253-3-6 pp. 23\u201331. American Telecommunication Systems Management Association, Nashville"},{"key":"228_CR7_228","unstructured":"Egecioglu, O., Gonzalez, T.: Minimum\u2010energy Broadcast in Simple Graphs with Limited Node Power. In: Proc. IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2001), Anaheim, August 2001 pp. 334\u2013338"},{"key":"228_CR8_228","first-page":"1","volume-title":"Algorithms and complexity in Durham 2005. Texts in Algorithmics, vol. 4","author":"V. Estivill\u2010Castro","year":"2005","unstructured":"Estivill\u2010Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P\u2011time extremal structure I. In: Algorithms and complexity in Durham 2005. Texts in Algorithmics, vol.\u00a04, pp. 1\u201341. Kings College Publications, London (2005)"},{"key":"228_CR9_228","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/0405010","volume":"5","author":"M. Fellows","year":"1992","unstructured":"Fellows, M., Langston, M.: On well-partial-order theory and its applications to combinatorial problems of VLSI design. SIAM J.\u00a0Discret. Math. 5, 117\u2013126 (1992)","journal-title":"SIAM J. Discret. Math."},{"key":"228_CR10_228","first-page":"1","volume-title":"Proceedings of the 29th Workshop on Graph Theoretic Concepts in Computer Science (WG 2003). Lecture Notes in Computer Science, vol. 2880","author":"M. Fellows","year":"2003","unstructured":"Fellows, M.: 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.\u00a02880, pp. 1\u201312. Springer, Berlin (2003)"},{"key":"228_CR11_228","first-page":"240","volume-title":"Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science (FST-TCS 2000). Lecture Notes in Theoretical Computer Science 1974","author":"M. Fellows","year":"2000","unstructured":"Fellows, M., McCartin, C., Rosamond, F., Stege, U.: 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 1974, pp. 240\u2013251. Springer, Berlin (2000)"},{"key":"228_CR12_228","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"D.J. Kleitman","year":"1991","unstructured":"Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SIAM J.\u00a0Discret. Math. 4, 99\u2013106 (1991)","journal-title":"SIAM J. Discret. Math."},{"key":"228_CR13_228","first-page":"57","volume":"8","author":"M. Kouider","year":"2006","unstructured":"Kouider, M., Vestergaard, P.D.: Generalized connected domination in graphs. Discret. Math. Theor. Comput. Sci. (DMTCS) 8, 57\u201364 (2006)","journal-title":"Discret. Math. Theor. Comput. Sci. (DMTCS)"},{"key":"228_CR14_228","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.: Approximating maximum leaf spanning trees in almost linear time. J.\u00a0Algorithm 29, 132\u2013141 (1998)","journal-title":"J. Algorithm"},{"key":"228_CR15_228","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed\u2010Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Lecture Series in Mathematics and Its Applications, Oxford University Press, Oxford (2006)"},{"key":"228_CR16_228","unstructured":"Prieto\u2010Rodriguez, E.: Systematic kernelization in FPT algorithm design. Dissertation, School of Electrical Engineering and Computer Science, University of Newcastle, Australia (2005)"},{"key":"228_CR17_228","first-page":"441","volume-title":"Proceedings of the 6th Annual European Symposium on Algorithms (ESA'98). Lecture Notes in Computer Science, vol. 1461","author":"R. Solis-Oba","year":"1998","unstructured":"Solis-Oba, R.: 2\u2011approximation algorithm for finding a\u00a0spanning 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.\u00a01461, pp. 441\u2013452. Springer, Berlin (1998)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T23:18:34Z","timestamp":1662160714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_228"}},"subtitle":["2005; Estivill-Castro, Fellows, Langston, Rosamond"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_228","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}