{"id":"https://openalex.org/W7166885622","doi":"https://doi.org/10.4230/lipics.icalp.2026.147","title":"Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs","display_name":"Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166885622","doi":"https://doi.org/10.4230/lipics.icalp.2026.147"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26536","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.147","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.147/LIPIcs.ICALP.2026.147.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.147/LIPIcs.ICALP.2026.147.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101668134","display_name":"Pan Peng","orcid":"https://orcid.org/0000-0003-2700-5699"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Peng, Pan","raw_affiliation_strings":["School of Computer Science and Technology, University of Science and Technology of China, Hefei, China"],"raw_orcid":"https://orcid.org/0000-0003-2700-5699","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, University of Science and Technology of China, Hefei, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032845602","display_name":"Y Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wang, Yuyang","raw_affiliation_strings":["School of Computer Science and Technology, University of Science and Technology of China, Hefei, China"],"raw_orcid":"https://orcid.org/0009-0002-6799-8277","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, University of Science and Technology of China, Hefei, China","institution_ids":["https://openalex.org/I126520041"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126520041"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79484065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8770999908447266,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8770999908447266,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.06809999793767929,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.009600000455975533,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7824000120162964},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6248000264167786},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.4546999931335449},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3944999873638153},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.3765000104904175},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.36739999055862427},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.36629998683929443},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.35600000619888306},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3531999886035919}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7824000120162964},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6248000264167786},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6105999946594238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4916999936103821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45660001039505005},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.4546999931335449},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3944999873638153},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.3765000104904175},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.36739999055862427},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.36629998683929443},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.35600000619888306},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3531999886035919},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.35089999437332153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3506999909877777},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.34389999508857727},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3424000144004822},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3411000072956085},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.33160001039505005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.323199987411499},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.32170000672340393},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.31859999895095825},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.2976999878883362},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.25619998574256897},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.25380000472068787}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26536","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.147","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.147/LIPIcs.ICALP.2026.147.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.147","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.147","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26536","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.147","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.147/LIPIcs.ICALP.2026.147.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166885622.pdf","grobid_xml":"https://content.openalex.org/works/W7166885622.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,71,115,270],"study":[1],"local":[2],"computation":[3],"algorithms":[4],"(LCAs)":[5],"for":[6,19,57,67,89,106,126,158,164,177,202,219],"constructing":[7],"spanning":[8,30,58,90,108,113,222],"trees.":[9,91,114],"In":[10],"this":[11],"setting,":[12],"the":[13,34,46,49,165,189,220,243],"goal":[14],"is":[15,40,52,93,143,278],"to":[16,28,216,250],"determine":[17],"locally,":[18],"each":[20,251],"edge":[21,252],"e":[22],"\u2208":[23],"E,":[24],"whether":[25],"it":[26],"belongs":[27],"a":[29,73,232],"tree":[31,223],"T":[32,39],"of":[33,48,78,168,284],"input":[35],"graph":[36,69,235,245],"G,":[37,285],"where":[38,261],"defined":[41],"implicitly":[42],"by":[43,248],"G":[44,246],"and":[45,75,133,148,255,265],"randomness":[47],"algorithm.":[50],"It":[51],"known":[53],"that":[54,84,163,272,277],"sublinear-probe":[55],"LCAs":[56,88,105,218],"trees":[59],"do":[60,85],"not":[61],"exist":[62],"in":[63,103],"general":[64],"graphs,":[65],"even":[66,157],"simple":[68],"families.":[70],"identify":[72],"natural":[74,166],"well-studied":[76],"class":[77,167],"graphs":[79,82,127,170,204],"-":[80,83,209],"expander":[81,228],"admit":[86],"sublinear-time":[87],"This":[92],"perhaps":[94],"surprising,":[95],"as":[96],"previous":[97],"work":[98],"on":[99,226],"expanders":[100,185],"only":[101],"succeeded":[102],"designing":[104],"sparse":[107],"subgraphs,":[109],"rather":[110],"than":[111],"full":[112],"design":[116,217],"an":[117,199,253,275,281],"LCA":[118,201,276],"with":[119,128,173,186,205,237,280,286],"probe":[120,206,287],"complexity":[121,207,288],"O(\u221an":[122],"((log\u00b2n)/\u03d5\u00b2":[123],"+":[124],"d))":[125],"conductance":[129],"at":[130,136],"least":[131],"\u03d5":[132,147],"maximum":[134],"degree":[135],"most":[137],"d":[138,149],"(not":[139],"necessarily":[140],"constant),":[141],"which":[142],"nearly":[144],"optimal":[145],"when":[146],"are":[150,155,184],"constants,":[151],"since":[152],"\u03a9(\u221an)":[153],"probes":[154],"necessary":[156],"expanders.":[159],"Next,":[160],"we":[161,197,212,241],"show":[162,271],"Erd\u0151s-R\u00e9nyi":[169],"G(n,":[171],"p)":[172],"np":[174],"=":[175,267],"n^\u03b4":[176],"any":[178],"constant":[179],"\u03b4":[180],">":[181],"0":[182],"(which":[183],"high":[187],"probability),":[188],"\u221an":[190],"lower":[191],"bound":[192],"can":[193],"be":[194],"bypassed.":[195],"Specifically,":[196,230],"give":[198],"average-case":[200],"such":[203],"O\u0303(\u221a{n^{1":[208],"\u03b4}}).":[210],"Finally,":[211],"extend":[213],"our":[214],"techniques":[215],"minimum":[221],"(MST)":[224],"problem":[225],"weighted":[227,244],"graphs.":[229],"given":[231],"d-regular":[233],"unweighted":[234],"\u0304{G}":[236],"sufficiently":[238],"strong":[239],"expansion,":[240],"consider":[242],"obtained":[247],"assigning":[249],"independent":[254],"uniform":[256],"random":[257],"weight":[258],"from":[259],"{1,\u2026,W},":[260],"W":[262,266],"\u2264":[263],"d/2":[264],"o(log":[268],"n).":[269],"there":[273],"exists":[274],"consistent":[279],"exact":[282],"MST":[283],"O\u0303(\u221and\u00b2).":[289]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}