{"id":"https://openalex.org/W2050587004","doi":"https://doi.org/10.1142/s0129054113500226","title":"POPULAR SPANNING TREES","display_name":"POPULAR SPANNING TREES","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2050587004","doi":"https://doi.org/10.1142/s0129054113500226","mag":"2050587004"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113500226","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500226","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5007835513","display_name":"Andreas Darmann","orcid":"https://orcid.org/0000-0002-0477-4578"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"ANDREAS DARMANN","raw_affiliation_strings":["Institute of Public Economics, University of Graz, Universitaetsstr. 15, A-8010 Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Public Economics, University of Graz, Universitaetsstr. 15, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007835513"],"corresponding_institution_ids":["https://openalex.org/I15766117"],"apc_list":null,"apc_paid":null,"fwci":3.5606,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.94248559,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"05","first_page":"655","last_page":"677"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9847000241279602,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9836000204086304,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/condorcet-method","display_name":"Condorcet method","score":0.8067995309829712},{"id":"https://openalex.org/keywords/voting","display_name":"Voting","score":0.7606528997421265},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7493683099746704},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6248726844787598},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4834176301956177},{"id":"https://openalex.org/keywords/approval-voting","display_name":"Approval voting","score":0.4578283429145813},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44232243299484253},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4423108994960785},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.42488664388656616},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4149560332298279},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38592010736465454}],"concepts":[{"id":"https://openalex.org/C140940377","wikidata":"https://www.wikidata.org/wiki/Q868720","display_name":"Condorcet method","level":4,"score":0.8067995309829712},{"id":"https://openalex.org/C520049643","wikidata":"https://www.wikidata.org/wiki/Q189760","display_name":"Voting","level":3,"score":0.7606528997421265},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7493683099746704},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6248726844787598},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4834176301956177},{"id":"https://openalex.org/C100479058","wikidata":"https://www.wikidata.org/wiki/Q526530","display_name":"Approval voting","level":5,"score":0.4578283429145813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44232243299484253},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4423108994960785},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.42488664388656616},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4149560332298279},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38592010736465454},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054113500226","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500226","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.7099999785423279}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1491195793","https://openalex.org/W1521226446","https://openalex.org/W1523000149","https://openalex.org/W1564148014","https://openalex.org/W1805637476","https://openalex.org/W1976060283","https://openalex.org/W1977545325","https://openalex.org/W1979125736","https://openalex.org/W1995443028","https://openalex.org/W2013372570","https://openalex.org/W2033301836","https://openalex.org/W2040117841","https://openalex.org/W2050987767","https://openalex.org/W2052367117","https://openalex.org/W2057094384","https://openalex.org/W2058237281","https://openalex.org/W2063897561","https://openalex.org/W2066855419","https://openalex.org/W2076332815","https://openalex.org/W2096797149","https://openalex.org/W2103267790","https://openalex.org/W2131891143","https://openalex.org/W2166619685","https://openalex.org/W2294970663","https://openalex.org/W2406957879","https://openalex.org/W3099446300","https://openalex.org/W3124102069","https://openalex.org/W3125944074"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W4206043061","https://openalex.org/W2812810142","https://openalex.org/W2942013815","https://openalex.org/W2387385213","https://openalex.org/W2256978550","https://openalex.org/W2157421865","https://openalex.org/W2069230977","https://openalex.org/W2050587004"],"abstract_inverted_index":{"Combinatorial":[0],"Optimization":[1],"is":[2,11],"combined":[3],"with":[4,81],"Social":[5],"Choice":[6],"Theory":[7],"when":[8],"the":[9,15,29,32,68,75,84,93],"goal":[10],"to":[12,83],"decide":[13],"on":[14,48,74],"quality":[16,76],"of":[17,21,31,40,77],"a":[18,41,78],"spanning":[19,34,79],"tree":[20,80],"an":[22],"undirected":[23],"graph.":[24],"Given":[25],"individual":[26],"preferences":[27],"over":[28],"edges":[30],"graph,":[33],"trees":[35],"are":[36,46],"compared":[37],"by":[38],"means":[39],"Condorcet":[42],"criterion.":[43],"The":[44],"comparisons":[45],"based":[47],"scoring":[49],"functions":[50],"used":[51],"in":[52,72],"classic":[53],"voting":[54,59,86],"rules":[55,87],"such":[56],"as":[57],"approval":[58],"and":[60,100],"Borda":[61],"voting.":[62],"In":[63,89],"this":[64],"work,":[65],"we":[66,91],"investigate":[67],"computational":[69],"complexity":[70],"involved":[71],"deciding":[73],"respect":[82],"different":[85],"adapted.":[88],"particular,":[90],"draw":[92],"sharp":[94],"separation":[95],"line":[96],"between":[97],"polynomially":[98],"solvable":[99],"computationally":[101],"intractable":[102],"instances.":[103]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}