{"id":"https://openalex.org/W1993219112","doi":"https://doi.org/10.1145/2000807.2000812","title":"Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree","display_name":"Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree","publication_year":2011,"publication_date":"2011-09-01","ids":{"openalex":"https://openalex.org/W1993219112","doi":"https://doi.org/10.1145/2000807.2000812","mag":"1993219112"},"language":"en","primary_location":{"id":"doi:10.1145/2000807.2000812","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2000807.2000812","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","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/A5079322669","display_name":"Paul Bonsma","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Paul Bonsma","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027034693","display_name":"Frederic Dorn","orcid":null},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frederic Dorn","raw_affiliation_strings":["Humboldt-Universit\u00e4t zu Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8938,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73622992,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"4","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.8377946019172668},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7469701170921326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6829220056533813},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6601146459579468},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6269210577011108},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5728901028633118},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5366283059120178},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.530546247959137},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.48179954290390015},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.43928876519203186},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42134279012680054},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4110201597213745},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11512160301208496}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8377946019172668},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7469701170921326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6829220056533813},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6601146459579468},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6269210577011108},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5728901028633118},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5366283059120178},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.530546247959137},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.48179954290390015},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.43928876519203186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42134279012680054},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4110201597213745},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11512160301208496},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2000807.2000812","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2000807.2000812","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5328725347","display_name":null,"funder_award_id":"GRK1408","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W43334377","https://openalex.org/W782865653","https://openalex.org/W1517036688","https://openalex.org/W1517042931","https://openalex.org/W1537449969","https://openalex.org/W1538293711","https://openalex.org/W1539910521","https://openalex.org/W1548164611","https://openalex.org/W1553492721","https://openalex.org/W1565265107","https://openalex.org/W1598441350","https://openalex.org/W1615046544","https://openalex.org/W1661831896","https://openalex.org/W1912364756","https://openalex.org/W1920480330","https://openalex.org/W1971373505","https://openalex.org/W1987233075","https://openalex.org/W2011105641","https://openalex.org/W2016590962","https://openalex.org/W2054396313","https://openalex.org/W2066904980","https://openalex.org/W2068173146","https://openalex.org/W2078040110","https://openalex.org/W2083082533","https://openalex.org/W2083748805","https://openalex.org/W2107372402","https://openalex.org/W2112451853","https://openalex.org/W2115327685","https://openalex.org/W2116539983","https://openalex.org/W2120935614","https://openalex.org/W2128691580","https://openalex.org/W2155984879","https://openalex.org/W2170778679","https://openalex.org/W2296148711","https://openalex.org/W2798588639","https://openalex.org/W2913688336","https://openalex.org/W2950732731","https://openalex.org/W4292230561","https://openalex.org/W6630973240","https://openalex.org/W6750258011"],"related_works":["https://openalex.org/W2363199028","https://openalex.org/W2987887460","https://openalex.org/W4255598955","https://openalex.org/W1987177025","https://openalex.org/W2765600275","https://openalex.org/W2953710272","https://openalex.org/W3088611359","https://openalex.org/W4301179398","https://openalex.org/W3006501763","https://openalex.org/W4300501056"],"abstract_inverted_index":{"An":[0,21],"out-tree":[1],"T":[2],"of":[3,42,49,118,134,144,152,156,225,237],"a":[4,9,24,77],"directed":[5,16],"graph":[6],"D":[7,29,35,50,65,72,79,153,164,168,184,192,203],"is":[8,23,109,216,235],"rooted":[10],"tree":[11],"subgraph":[12],"with":[13,84,185,227],"all":[14,45,150],"arcs":[15,151],"outwards":[17],"from":[18],"the":[19,39,105,115,132,138,142,210,222],"root.":[20],"out-branching":[22],"spanning":[25],"out-tree.":[26],"By":[27],"\u2113(":[28,71,167],")":[30,66,73,93,126,165,193,204,208],"and":[31,47,69,112,218],"\u2113":[32,62,161,189,200],"s":[33,63,162,190,201],"(":[34,64,89,121,163,191,202],"),":[36,197],"we":[37,146,173],"denote":[38],"maximum":[40],"number":[41],"leaves":[43],"over":[44],"out-trees":[46],"out-branchings":[48,108],",":[51],"respectively.":[52],"We":[53],"give":[54],"fixed":[55],"parameter":[56],"tractable":[57],"algorithms":[58],"for":[59,76,107,180,221],"deciding":[60],"whether":[61,70,104],"\u2265":[67,74,166,194,205],"k":[68,75,90,92,122,125],"digraph":[78],"on":[80,114],"n":[81,95,128,196,207],"vertices,":[82],"both":[83],"time":[85],"complexity":[86,117,139],"2":[87,119,124],"O":[88,96,120,129],"log":[91,123],"\u00b7":[94,127],"(1)":[97,130],".":[98],"This":[99,214],"answers":[100],"an":[101],"open":[102],"question":[103],"problem":[106],"in":[110,131,141,175,231],"FPT,":[111],"improves":[113],"previous":[116],"case":[133,143],"out-trees.":[135],"To":[136],"obtain":[137],"bound":[140,172,215],"out-branchings,":[145],"prove":[147,174],"that":[148,179],"when":[149],"are":[154],"part":[155,236],"at":[157,238],"least":[158,239],"one":[159,240],"out-branching,":[160],")/3.":[169],"The":[170],"second":[171],"this":[176],"article":[177],"states":[178],"strongly":[181],"connected":[182],"digraphs":[183,226],"minimum":[186,228],"in-degree":[187,229],"3,":[188],"\u0398(\u221a":[195],"where":[198],"previously":[199],"\u0398(3\u221a":[206],"was":[209],"best":[211],"known":[212],"bound.":[213],"tight,":[217],"also":[219],"holds":[220],"larger":[223],"class":[224],"3":[230],"which":[232],"every":[233],"arc":[234],"out-branching.":[241]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}