{"id":"https://openalex.org/W7163763760","doi":"https://doi.org/10.1007/978-3-032-27732-9_10","title":"Breadth-First Search Trees with\u00a0Many or\u00a0Few Leaves","display_name":"Breadth-First Search Trees with\u00a0Many or\u00a0Few Leaves","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163763760","doi":"https://doi.org/10.1007/978-3-032-27732-9_10"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-27732-9_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-27732-9_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028672431","display_name":"Jesse Beisegel","orcid":"https://orcid.org/0000-0002-8760-0169"},"institutions":[{"id":"https://openalex.org/I51783024","display_name":"Brandenburg University of Technology Cottbus-Senftenberg","ror":"https://ror.org/02wxx3e24","country_code":"DE","type":"education","lineage":["https://openalex.org/I51783024"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jesse Beisegel","raw_affiliation_strings":["Institute of Mathematics, Brandenburg University of Technology, Cottbus, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Brandenburg University of Technology, Cottbus, Germany","institution_ids":["https://openalex.org/I51783024"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138035162","display_name":"Ekkehard K\u00f6hler","orcid":null},"institutions":[{"id":"https://openalex.org/I51783024","display_name":"Brandenburg University of Technology Cottbus-Senftenberg","ror":"https://ror.org/02wxx3e24","country_code":"DE","type":"education","lineage":["https://openalex.org/I51783024"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ekkehard K\u00f6hler","raw_affiliation_strings":["Institute of Mathematics, Brandenburg University of Technology, Cottbus, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Brandenburg University of Technology, Cottbus, Germany","institution_ids":["https://openalex.org/I51783024"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138069195","display_name":"Robert Scheffler","orcid":null},"institutions":[{"id":"https://openalex.org/I51783024","display_name":"Brandenburg University of Technology Cottbus-Senftenberg","ror":"https://ror.org/02wxx3e24","country_code":"DE","type":"education","lineage":["https://openalex.org/I51783024"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Robert Scheffler","raw_affiliation_strings":["Institute of Mathematics, Brandenburg University of Technology, Cottbus, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Brandenburg University of Technology, Cottbus, Germany","institution_ids":["https://openalex.org/I51783024"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002855059","display_name":"Martin Strehler","orcid":"https://orcid.org/0000-0003-4241-6584"},"institutions":[{"id":"https://openalex.org/I4210150056","display_name":"Wests\u00e4chsische Hochschule Zwickau","ror":"https://ror.org/04ms51788","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210150056"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Strehler","raw_affiliation_strings":["Department of Mathematics, Wests\u00e4chsische Hochschule Zwickau, Zwickau, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Wests\u00e4chsische Hochschule Zwickau, Zwickau, Germany","institution_ids":["https://openalex.org/I4210150056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5138069195"],"corresponding_institution_ids":["https://openalex.org/I51783024"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.96829522,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"131","last_page":"145"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6589999794960022,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6589999794960022,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.06279999762773514,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.06080000102519989,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6787999868392944},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.6527000069618225},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5712000131607056},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5504999756813049},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5198000073432922},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.49470001459121704},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.4578000009059906},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44850000739097595},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44290000200271606},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.392300009727478}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6787999868392944},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.6527000069618225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6154999732971191},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5712000131607056},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5504999756813049},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5309000015258789},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5198000073432922},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.49470001459121704},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.4578000009059906},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44850000739097595},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44290000200271606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4189999997615814},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.392300009727478},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.3840000033378601},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.3765999972820282},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3635999858379364},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.34630000591278076},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3411000072956085},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.33090001344680786},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.3278999924659729},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.32019999623298645},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.3021000027656555},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.28290000557899475},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.27149999141693115},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.27059999108314514},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2614000141620636},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-27732-9_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-27732-9_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5767379999160767,"display_name":"Zero hunger","id":"https://metadata.un.org/sdg/2"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1517042931","https://openalex.org/W1527003156","https://openalex.org/W1562509859","https://openalex.org/W1565265107","https://openalex.org/W1579049696","https://openalex.org/W1631636474","https://openalex.org/W1822472214","https://openalex.org/W1880580445","https://openalex.org/W1981097305","https://openalex.org/W1991477862","https://openalex.org/W2022841964","https://openalex.org/W2036263637","https://openalex.org/W2066904980","https://openalex.org/W2069643240","https://openalex.org/W2080222130","https://openalex.org/W2086119402","https://openalex.org/W2086423153","https://openalex.org/W2087477484","https://openalex.org/W2101880654","https://openalex.org/W2115943606","https://openalex.org/W2116087731","https://openalex.org/W2161426837","https://openalex.org/W2228103624","https://openalex.org/W2275786105","https://openalex.org/W2283061813","https://openalex.org/W2401610261","https://openalex.org/W2556960737","https://openalex.org/W2595660128","https://openalex.org/W2748096547","https://openalex.org/W2898380896","https://openalex.org/W2914414140","https://openalex.org/W2946173551","https://openalex.org/W2962875076","https://openalex.org/W2964124830","https://openalex.org/W3174133701","https://openalex.org/W4285506155","https://openalex.org/W4285601507","https://openalex.org/W4294659499","https://openalex.org/W4405257076","https://openalex.org/W4410773963","https://openalex.org/W4413071398","https://openalex.org/W4414785433","https://openalex.org/W7118795580"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-08T06:17:55.609145","created_date":"2026-06-07T00:00:00"}