{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:02Z","timestamp":1780783142952,"version":"3.54.1"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_10","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:24Z","timestamp":1780780524000},"page":"131-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Breadth-First Search Trees with\u00a0Many or\u00a0Few Leaves"],"prefix":"10.1007","author":[{"given":"Jesse","family":"Beisegel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ekkehard","family":"K\u00f6hler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Scheffler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Strehler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"10_CR1","unstructured":"Aazami, A.: Hardness Results and Approximation Algorithms for Some Problems on Graphs. Ph.D. Thesis, University of Waterloo (2008)"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1002\/jgt.21637","volume":"72","author":"F Barioli","year":"2013","unstructured":"Barioli, F., et al.: Parameters related to tree-width, zero forcing, and maximum nullity of a graph. J. Graph Theory 72(2), 146\u2013177 (2013)","journal-title":"J. Graph Theory"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Beisegel, J., et al.: On the end-vertex problem of graph searches. Discrete Math. Theor. Comput. Sci. 21 (2019)","DOI":"10.23638\/DMTCS-21-1-13"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1137\/20M1313301","volume":"35","author":"J Beisegel","year":"2021","unstructured":"Beisegel, J., et al.: The recognition problem of graph search trees. SIAM J. Discrete Math. 35(2), 1418\u20131446 (2021)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR5","unstructured":"Beisegel, J., K\u00f6hler, E., Ratajczak, F., Scheffler, R., Strehler, M.: Graph search trees and the intermezzo problem. In: MFCS 2024. LIPIcs, vol. 306, pp. 22:1\u201322:18 (2024)"},{"key":"10_CR6","unstructured":"Beisegel, J., K\u00f6hler, E., Scheffler, R., Strehler, M.: Breadth-first search trees with many or few leaves (2026). arXiv:2604.00691"},{"key":"10_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2025.103680","volume":"154","author":"B Bergougnoux","year":"2025","unstructured":"Bergougnoux, B., Blaser, N., Fellows, M.R., Golovach, P.A., Rosamond, F.A., Sam, E.: On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves. J. Comput. Syst. Sci. 154, 103680 (2025)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bhyravarapu, S., Kanesh, L., Kundu, M., Lokshtanov, D., Saurabh, S.: Parameterized algorithms for power edge set and zero forcing set. In: IWOCA 2025, pp. 349\u2013361 (2025)","DOI":"10.1007\/978-3-031-98740-3_25"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1993.1001","volume":"14","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: On linear time minor tests with depth-first search. J. Algorithms 14(1), 1\u201323 (1993)","journal-title":"J. Algorithms"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-540-78773-0_46","volume-title":"LATIN 2008: Theoretical Informatics","author":"P Bonsma","year":"2008","unstructured":"Bonsma, P., Zickfeld, F.: Spanning trees with many leaves in graphs without diamonds and blossoms. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 531\u2013543. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_46"},{"key":"10_CR11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Discrete Mathematics and Applications (1999)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.disopt.2017.07.001","volume":"26","author":"B Bre\u0161ar","year":"2017","unstructured":"Bre\u0161ar, B., et al.: Grundy dominating sequences and zero forcing sets. Discrete Optim. 26, 66\u201377 (2017)","journal-title":"Discrete Optim."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.disc.2014.07.016","volume":"336","author":"B Bre\u0161ar","year":"2014","unstructured":"Bre\u0161ar, B., Gologranc, T., Milani\u010d, M., Rall, D.F., Rizzi, R.: Dominating sequences in graphs. Discrete Math. 336, 22\u201336 (2014)","journal-title":"Discrete Math."},{"issue":"6","key":"10_CR14","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1016\/j.disc.2016.01.017","volume":"339","author":"B Bre\u0161ar","year":"2016","unstructured":"Bre\u0161ar, B., Henning, M.A., Rall, D.F.: Total dominating sequences in graphs. Discrete Math. 339(6), 1665\u20131676 (2016)","journal-title":"Discrete Math."},{"issue":"2","key":"10_CR15","first-page":"57","volume":"16","author":"P Charbit","year":"2014","unstructured":"Charbit, P., Habib, M., Mamcarz, A.: Influence of the tie-break rule on the end-vertex problem. Discrete Math. Theor. Comput. Sci. 16(2), 57\u201372 (2014)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.dam.2015.06.011","volume":"199","author":"DG Corneil","year":"2016","unstructured":"Corneil, D.G., Dusart, J., Habib, M., Mamcarz, A., de Montgolfier, F.: A tie-break model for graph search. Discrete Appl. Math. 199, 89\u2013100 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.dam.2009.10.001","volume":"158","author":"DG Corneil","year":"2010","unstructured":"Corneil, D.G., K\u00f6hler, E., Lanlignel, J.M.: On end-vertices of Lexicographic Breadth First Searches. Discrete Appl. Math. 158(5), 434\u2013443 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/050623498","volume":"22","author":"DG Corneil","year":"2008","unstructured":"Corneil, D.G., Krueger, R.: A unified view of graph searching. SIAM J. Discrete Math. 22(4), 1259\u20131276 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: basic results. SIAM J. Comput. 24(4), 873\u2013921 (1995)","journal-title":"SIAM J. Comput."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/0405010","volume":"5","author":"MR Fellows","year":"1992","unstructured":"Fellows, M.R., Langston, M.A.: On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM J. Discrete Math. 5(1), 117\u2013126 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., McCartin, C., Rosamond, F.A., Stege, U.: Coordinatized kernels and catalytic reductions: an improved FPT algorithm for max leaf spanning tree and other problems. In: FST TCS 2000. LNCS, vol. 1974, pp. 240\u2013251 (2000)","DOI":"10.1007\/3-540-44450-5_19"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2012.03.004","volume":"79","author":"FV Fomin","year":"2013","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S., Thomass\u00e9, S.: A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. 79(1), 1\u20136 (2013)","journal-title":"J. Comput. Syst. Sci."},{"issue":"13","key":"10_CR25","doi-asserted-by":"publisher","first-page":"1931","DOI":"10.1016\/S0305-0548(02)00117-X","volume":"30","author":"T Fujie","year":"2003","unstructured":"Fujie, T.: An exact algorithm for the maximum leaf spanning tree problem. Comput. Oper. Res. 30(13), 1931\u20131944 (2003)","journal-title":"Comput. Oper. Res."},{"key":"10_CR26","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, W. H (1979)"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, vol.\u00a057. Elsevier, 2nd edn. (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"issue":"1\u20132","key":"10_CR28","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M Habib","year":"2000","unstructured":"Habib, M., McConnell, R.M., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234(1\u20132), 59\u201384 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR29","unstructured":"Hagerup, T.: Biconnected graph assembly and recognition of DFS trees. Tech. Rep. A 85\/03, Universit\u00e4t des Saarlandes (1985)"},{"key":"10_CR30","unstructured":"Hagerup, T., Nowak, M.: Recognition of spanning trees defined by graph searches. Tech. Rep. A 85\/08, Universit\u00e4t des Saarlandes (1985)"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Hogben, L., Lin, J.C.H., Shader, B.L.: Inverse Problems and Zero Forcing For Graphs, Mathematical Surveys and Monographs, vol.\u00a0270. AMS (2022)","DOI":"10.1090\/surv\/270"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10_CR33","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison Wesley (2006)"},{"issue":"4","key":"10_CR34","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1007\/s00453-010-9454-5","volume":"61","author":"J Kneis","year":"2011","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: A new algorithm for finding trees with many leaves. Algorithmica 61(4), 882\u2013897 (2011)","journal-title":"Algorithmica"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-50728-0_37","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E Korach","year":"1989","unstructured":"Korach, E., Ostfeld, Z.: DFS tree construction: algorithms and characterizations. In: van Leeuwen, J. (ed.) WG 1988. LNCS, vol. 344, pp. 87\u2013106. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-50728-0_37"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-319-18173-8_22","volume-title":"Algorithms and Complexity","author":"D Kratsch","year":"2015","unstructured":"Kratsch, D., Liedloff, M., Meister, D.: End-vertices of graph search algorithms. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 300\u2013312. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_22"},{"key":"10_CR37","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2022.07.012","volume":"930","author":"P Li","year":"2022","unstructured":"Li, P., Shang, J., Shi, Y.: A simple linear time algorithm to solve the MIST problem on interval graphs. Theor. Comput. Sci. 930, 77\u201385 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR38","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.ic.2016.11.003","volume":"252","author":"W Li","year":"2017","unstructured":"Li, W., Cao, Y., Chen, J., Wang, J.: Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. Inf. Comput. 252, 187\u2013200 (2017)","journal-title":"Inf. Comput."},{"key":"10_CR39","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.laa.2018.11.003","volume":"563","author":"JCH Lin","year":"2019","unstructured":"Lin, J.C.H.: Zero forcing number, Grundy domination number, and their variants. Linear Algebra Appl. 563, 240\u2013254 (2019)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"10_CR40","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(90)90155-Q","volume":"34","author":"U Manber","year":"1990","unstructured":"Manber, U.: Recognizing breadth-first search trees in linear time. Inf. Process. Lett. 34(4), 167\u2013171 (1990)","journal-title":"Inf. Process. Lett."},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Prieto, E., Sloper, C.: Either\/Or: Using Vertex Cover structure in designing FPT-algorithms \u2013 The case of $$k$$- Internal Spanning Tree. In: WADS 2003. LNCS, vol. 2748, pp. 474\u2013483 (2003)","DOI":"10.1007\/978-3-540-45078-8_41"},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"Raible, D., Fernau, H.: An amortized search tree analysis for $$k$$-leaf spanning tree. In: SOFSEM 2010. LNCS, vol.\u00a05901, pp. 672\u2013684 (2010)","DOI":"10.1007\/978-3-642-11266-9_56"},{"key":"10_CR43","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.tcs.2016.02.011","volume":"626","author":"A Reich","year":"2016","unstructured":"Reich, A.: Complexity of the maximum leaf spanning tree problem on planar and regular graphs. Theor. Comput. Sci. 626, 134\u2013143 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"10_CR44","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1007\/s00453-022-00981-5","volume":"84","author":"G Rong","year":"2022","unstructured":"Rong, G., Cao, Y., Wang, J., Wang, Z.: Graph searches and their end vertices. Algorithmica 84(9), 2642\u20132666 (2022)","journal-title":"Algorithmica"},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Rong, G., Yuan, B., Yang, Y., Zhang, Z.: A linear-time algorithm for the MCS end-vertex problem on chordal graphs: a bonus-driven search strategy. In: SOSA 2026. pp. 298\u2013311 (2026)","DOI":"10.1137\/1.9781611978964.23"},{"issue":"2","key":"10_CR46","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"10_CR47","unstructured":"Scheffler, R.: On the parameterized complexity of Grundy domination and zero forcing problems (2025). arXiv:2508.18104"},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Scheffler, R.: The partial search order problem. Electron. J. Comb. 32(4) (2025)","DOI":"10.37236\/12654"},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Scheffler, R.: On the leaves of graph search trees. Ars Math. Contemp. 26 (2026)","DOI":"10.26493\/1855-3974.3238.2a8"},{"issue":"5","key":"10_CR50","doi-asserted-by":"publisher","first-page":"3419","DOI":"10.1007\/s10878-022-00897-4","volume":"44","author":"G Sharma","year":"2022","unstructured":"Sharma, G., Pandey, A., Wigal, M.C.: Algorithms for maximum internal spanning tree problem for some graph classes. J. Comb. Optim. 44(5), 3419\u20133445 (2022)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"10_CR51","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"key":"10_CR52","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall (2001)"},{"key":"10_CR53","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ejc.2017.07.018","volume":"68","author":"M Zehavi","year":"2018","unstructured":"Zehavi, M.: The $$k$$-leaf spanning tree problem admits a Klam value of 39. Eur. J. Comb. 68, 175\u2013203 (2018)","journal-title":"Eur. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:30Z","timestamp":1780780530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}