{"id":"https://openalex.org/W7108713865","doi":"https://doi.org/10.3390/a18120760","title":"Computing Well-Balanced Spanning Trees of Unweighted Networks","display_name":"Computing Well-Balanced Spanning Trees of Unweighted Networks","publication_year":2025,"publication_date":"2025-11-29","ids":{"openalex":"https://openalex.org/W7108713865","doi":"https://doi.org/10.3390/a18120760"},"language":"en","primary_location":{"id":"doi:10.3390/a18120760","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120760","pdf_url":"https://www.mdpi.com/1999-4893/18/12/760/pdf?version=1764657752","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/18/12/760/pdf?version=1764657752","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Lovro \u0160ubelj","orcid":"https://orcid.org/0000-0002-4161-2260"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":true,"raw_author_name":"Lovro \u0160ubelj","raw_affiliation_strings":["Faculty of Computer and Information Science, University of Ljubljana, Ve\u010dna pot 113, 1000 Ljubljana, Slovenia","Faculty of Social Sciences, University of Ljubljana, Kardeljeva plo\u0161\u010dad 5, 1000 Ljubljana, Slovenia"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer and Information Science, University of Ljubljana, Ve\u010dna pot 113, 1000 Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]},{"raw_affiliation_string":"Faculty of Social Sciences, University of Ljubljana, Kardeljeva plo\u0161\u010dad 5, 1000 Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I153976015"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60870419,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"12","first_page":"760","last_page":"760"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.5838000178337097,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.5838000178337097,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.18700000643730164,"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"}},{"id":"https://openalex.org/T10799","display_name":"Data Visualization and Analytics","score":0.0697999969124794,"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.8335999846458435},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7678999900817871},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4864000082015991},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4657999873161316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4641999900341034},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.39800000190734863},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.3978999853134155},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.3840000033378601},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.38199999928474426}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8335999846458435},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7678999900817871},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5580000281333923},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4864000082015991},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4657999873161316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4641999900341034},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.39800000190734863},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.3978999853134155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.396699994802475},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3840000033378601},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3833000063896179},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.38199999928474426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35850000381469727},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33480000495910645},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.33379998803138733},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.3249000012874603},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3140999972820282},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.3070000112056732},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C34947359","wikidata":"https://www.wikidata.org/wiki/Q665189","display_name":"Complex network","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.2858999967575073},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28189998865127563},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.28130000829696655},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.2667999863624573},{"id":"https://openalex.org/C53471067","wikidata":"https://www.wikidata.org/wiki/Q7574076","display_name":"Spatial network","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.26170000433921814}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a18120760","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120760","pdf_url":"https://www.mdpi.com/1999-4893/18/12/760/pdf?version=1764657752","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:repozitorij.uni-lj.si:IzpisGradiva.php?id=176570","is_oa":true,"landing_page_url":"https://repozitorij.uni-lj.si/IzpisGradiva.php?id=176570","pdf_url":null,"source":{"id":"https://openalex.org/S4377196268","display_name":"Repository of the University of Ljubljana (University of Ljubljana)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153976015","host_organization_name":"University of Ljubljana","host_organization_lineage":["https://openalex.org/I153976015"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ISSN: 1999-4893","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:da73c0e527ba407089edc6f22cfbb433","is_oa":true,"landing_page_url":"https://doaj.org/article/da73c0e527ba407089edc6f22cfbb433","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 18, Iss 12, p 760 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a18120760","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120760","pdf_url":"https://www.mdpi.com/1999-4893/18/12/760/pdf?version=1764657752","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6822091680","display_name":null,"funder_award_id":"P5-0168","funder_id":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS"}],"funders":[{"id":"https://openalex.org/F4320322554","display_name":"Javna Agencija za Raziskovalno Dejavnost RS","ror":"https://ror.org/059bp8k51"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7108713865.pdf","grobid_xml":"https://content.openalex.org/works/W7108713865.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W1971937094","https://openalex.org/W1998694168","https://openalex.org/W2000042664","https://openalex.org/W2000910044","https://openalex.org/W2006218290","https://openalex.org/W2008620264","https://openalex.org/W2026729066","https://openalex.org/W2056944867","https://openalex.org/W2063491776","https://openalex.org/W2075220720","https://openalex.org/W2092084789","https://openalex.org/W2111023939","https://openalex.org/W2111708605","https://openalex.org/W2112090702","https://openalex.org/W2115043726","https://openalex.org/W2119004437","https://openalex.org/W2146008005","https://openalex.org/W2148606196","https://openalex.org/W2150256170","https://openalex.org/W2159376684","https://openalex.org/W2163485494","https://openalex.org/W2167482691","https://openalex.org/W2171707538","https://openalex.org/W2318794083","https://openalex.org/W2331613197","https://openalex.org/W2526141444","https://openalex.org/W2562676961","https://openalex.org/W2581780941","https://openalex.org/W2593889720","https://openalex.org/W2753618891","https://openalex.org/W2784007581","https://openalex.org/W2793071066","https://openalex.org/W2946857491","https://openalex.org/W2950411297","https://openalex.org/W2951271819","https://openalex.org/W2951933113","https://openalex.org/W2963239847","https://openalex.org/W3001603454","https://openalex.org/W3103254713","https://openalex.org/W3205654403","https://openalex.org/W4213324534","https://openalex.org/W4220720216","https://openalex.org/W4226236648","https://openalex.org/W4237496336","https://openalex.org/W4388069418","https://openalex.org/W4389419870","https://openalex.org/W4397044852","https://openalex.org/W4401539236","https://openalex.org/W4404906398","https://openalex.org/W4408220523"],"related_works":[],"abstract_inverted_index":{"A":[0],"spanning":[1,56,119,156],"tree":[2,57],"of":[3,22,58,86,153,165],"a":[4,9,40,55,59,111,144],"network":[5,35,76],"or":[6,19,43],"graph":[7,131],"is":[8],"subgraph":[10],"that":[11,101,160],"connects":[12],"all":[13],"nodes":[14,106],"with":[15,95,137],"the":[16,28,66,73,84,102,105,150,154,163,169,175],"minimum":[17],"number":[18],"total":[20],"weight":[21],"edges.":[23],"Spanning":[24],"trees":[25,120],"are":[26,50,63,107,121],"among":[27],"simplest":[29],"yet":[30],"most":[31,74],"effective":[32],"techniques":[33],"for":[34,53,69,161],"simplification,":[36],"sampling,":[37],"and":[38,47,62,92,125,142,148],"uncovering":[39],"network\u2019s":[41],"backbone":[42],"skeleton.":[44],"Prim\u2019s":[45],"algorithm":[46,49,113,172],"Kruskal\u2019s":[48],"well-known":[51],"algorithms":[52,88],"computing":[54],"weighted":[60],"network,":[61,168],"therefore":[64],"also":[65,122],"default":[67],"procedure":[68],"unweighted":[70,90,167],"networks":[71,91],"in":[72],"popular":[75],"libraries.":[77],"In":[78],"this":[79],"paper,":[80],"we":[81],"empirically":[82],"evaluate":[83],"performance":[85],"these":[87],"on":[89,115,139],"compare":[93],"them":[94],"priority-first":[96],"search":[97,171],"algorithms.":[98],"We":[99,133,158],"show":[100],"distances":[103],"between":[104],"better":[108],"preserved":[109],"by":[110,129],"simpler":[112],"based":[114],"breadth-first":[116,170],"search.":[117],"The":[118],"more":[123],"compact":[124],"well-balanced,":[126],"as":[127],"measured":[128],"classical":[130],"indices.":[132],"support":[134],"our":[135],"findings":[136],"experiments":[138],"synthetic":[140],"graphs":[141],"over":[143],"thousand":[145],"real":[146],"networks,":[147],"demonstrate":[149],"practical":[151],"applications":[152],"computed":[155],"trees.":[157],"conclude":[159],"preserving":[162],"structure":[164],"an":[166],"should":[173],"be":[174],"preferred":[176],"choice.":[177]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-12-05T00:00:00"}