{"id":"https://openalex.org/W4415537540","doi":"https://doi.org/10.1007/s10878-025-01368-2","title":"Low-degree spanning trees of 2-edge-connected graphs in linear time","display_name":"Low-degree spanning trees of 2-edge-connected graphs in linear time","publication_year":2025,"publication_date":"2025-10-25","ids":{"openalex":"https://openalex.org/W4415537540","doi":"https://doi.org/10.1007/s10878-025-01368-2"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-025-01368-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01368-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01368-2.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01368-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048684673","display_name":"Dariusz Dereniowski","orcid":"https://orcid.org/0000-0003-4000-4818"},"institutions":[{"id":"https://openalex.org/I169333911","display_name":"Gda\u0144sk University of Technology","ror":"https://ror.org/006x4sc24","country_code":"PL","type":"education","lineage":["https://openalex.org/I169333911"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Dariusz Dereniowski","raw_affiliation_strings":["Gda\u0144sk University of Technology, 80-233, Gda\u0144sk, Poland"],"raw_orcid":"https://orcid.org/0000-0003-4000-4818","affiliations":[{"raw_affiliation_string":"Gda\u0144sk University of Technology, 80-233, Gda\u0144sk, Poland","institution_ids":["https://openalex.org/I169333911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076869546","display_name":"Janusz Dybizba\u0144ski","orcid":"https://orcid.org/0000-0002-2575-4373"},"institutions":[{"id":"https://openalex.org/I40413290","display_name":"University of Gda\u0144sk","ror":"https://ror.org/011dv8m48","country_code":"PL","type":"education","lineage":["https://openalex.org/I40413290"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Janusz Dybizba\u0144ski","raw_affiliation_strings":["University of Gdansk, 80-309, Gda\u0144sk, Poland"],"raw_orcid":"https://orcid.org/0000-0002-2575-4373","affiliations":[{"raw_affiliation_string":"University of Gdansk, 80-309, Gda\u0144sk, Poland","institution_ids":["https://openalex.org/I40413290"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114619941","display_name":"Przemys\u0142aw Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I4210155185","display_name":"Intel (Poland)","ror":"https://ror.org/05bx22c71","country_code":"PL","type":"company","lineage":["https://openalex.org/I1343180700","https://openalex.org/I4210155185"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Przemys\u0142aw Karpi\u0144ski","raw_affiliation_strings":["Intel Technology Poland Ltd., 80-298, Gda\u0144sk, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intel Technology Poland Ltd., 80-298, Gda\u0144sk, Poland","institution_ids":["https://openalex.org/I4210155185"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114619942","display_name":"Micha\u0142 Zakrzewski","orcid":"https://orcid.org/0000-0003-4845-7707"},"institutions":[{"id":"https://openalex.org/I40413290","display_name":"University of Gda\u0144sk","ror":"https://ror.org/011dv8m48","country_code":"PL","type":"education","lineage":["https://openalex.org/I40413290"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Zakrzewski","raw_affiliation_strings":["University of Gdansk, 80-309, Gda\u0144sk, Poland"],"raw_orcid":"https://orcid.org/0000-0003-4845-7707","affiliations":[{"raw_affiliation_string":"University of Gdansk, 80-309, Gda\u0144sk, Poland","institution_ids":["https://openalex.org/I40413290"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038614609","display_name":"Pawe\u0142 \u017byli\u0144ski","orcid":"https://orcid.org/0000-0001-6378-7742"},"institutions":[{"id":"https://openalex.org/I40413290","display_name":"University of Gda\u0144sk","ror":"https://ror.org/011dv8m48","country_code":"PL","type":"education","lineage":["https://openalex.org/I40413290"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 \u017byli\u0144ski","raw_affiliation_strings":["University of Gdansk, 80-309, Gda\u0144sk, Poland"],"raw_orcid":"https://orcid.org/0000-0001-6378-7742","affiliations":[{"raw_affiliation_string":"University of Gdansk, 80-309, Gda\u0144sk, Poland","institution_ids":["https://openalex.org/I40413290"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5048684673"],"corresponding_institution_ids":["https://openalex.org/I169333911"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34760146,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"50","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/spanning-tree","display_name":"Spanning tree","score":0.7989000082015991},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5300999879837036},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.5289999842643738},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5105000138282776},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5038999915122986},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4767000079154968},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4636000096797943},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4625999927520752},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4275999963283539}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7989000082015991},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7353000044822693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6643999814987183},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5300999879837036},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.5289999842643738},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5105000138282776},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5038999915122986},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4767000079154968},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4636000096797943},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4625999927520752},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45590001344680786},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4275999963283539},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4221000075340271},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4165000021457672},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.41429999470710754},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.3781999945640564},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.37779998779296875},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.3693999946117401},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.36629998683929443},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.320499986410141},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.31049999594688416},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.2985999882221222},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10878-025-01368-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01368-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01368-2.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10878-025-01368-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01368-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01368-2.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8977255895","display_name":null,"funder_award_id":"2018/31/B/ST6/00820","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320307102","display_name":"Intel Corporation","ror":"https://ror.org/01ek73717"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415537540.pdf","grobid_xml":"https://content.openalex.org/works/W4415537540.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W123718951","https://openalex.org/W2030579180","https://openalex.org/W2604625050","https://openalex.org/W4242000175","https://openalex.org/W4248133765","https://openalex.org/W4388691564"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1],"present":[2],"a":[3,9,14],"simple":[4],"linear-time":[5],"algorithm":[6],"that":[7,20],"finds":[8],"spanning":[10],"tree":[11],"T":[12,25],"of":[13,24],"given":[15],"2-edge-connected":[16],"graph":[17],"G":[18],"such":[19],"each":[21],"vertex":[22],"v":[23],"has":[26],"degree":[27],"at":[28],"most":[29],"$$\\lceil":[30],"\\frac{\\deg":[31],"_G(v)}{2}\\rceil":[32],"+":[33],"1$$":[34],".":[35]},"counts_by_year":[],"updated_date":"2026-03-09T07:00:12.390032","created_date":"2025-10-25T00:00:00"}