{"id":"https://openalex.org/W7109030827","doi":"https://doi.org/10.1145/3769788","title":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: A Labelling Approach","display_name":"Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: A Labelling Approach","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W7109030827","doi":"https://doi.org/10.1145/3769788"},"language":"en","primary_location":{"id":"doi:10.1145/3769788","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3769788","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"Proceedings of the ACM on Management of Data","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":null,"display_name":"Meihao Liao","orcid":"https://orcid.org/0000-0002-5808-3131"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Meihao Liao","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-5808-3131","affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Yueyang Pan","orcid":"https://orcid.org/0009-0002-6542-1087"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yueyang Pan","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0009-0002-6542-1087","affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Rong-Hua Li","orcid":"https://orcid.org/0000-0001-8658-6599"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Rong-Hua Li","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0001-8658-6599","affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"last","author":{"id":null,"display_name":"Guoren Wang","orcid":"https://orcid.org/0000-0002-8411-2127"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guoren Wang","raw_affiliation_strings":["Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-8411-2127","affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I125839683"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.49752289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"6","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.3700999915599823,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.3700999915599823,"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/T11106","display_name":"Data Management and Algorithms","score":0.28299999237060547,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.10980000346899033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7261999845504761},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6128000020980835},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.46480000019073486},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45910000801086426},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44929999113082886},{"id":"https://openalex.org/keywords/labelling","display_name":"Labelling","score":0.396699994802475},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.37959998846054077},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.3580000102519989},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.35409998893737793}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7261999845504761},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6128000020980835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5527999997138977},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.46480000019073486},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45910000801086426},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44929999113082886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4027000069618225},{"id":"https://openalex.org/C2780523633","wikidata":"https://www.wikidata.org/wiki/Q380709","display_name":"Labelling","level":2,"score":0.396699994802475},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39629998803138733},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.37959998846054077},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3580000102519989},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.35350000858306885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33379998803138733},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3221000134944916},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.32030001282691956},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C520416788","wikidata":"https://www.wikidata.org/wiki/Q5419229","display_name":"Exact solutions in general relativity","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C111208986","wikidata":"https://www.wikidata.org/wiki/Q901698","display_name":"Distance matrix","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27619999647140503},{"id":"https://openalex.org/C11577676","wikidata":"https://www.wikidata.org/wiki/Q134237","display_name":"Square root","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2612000107765198},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2547000050544739},{"id":"https://openalex.org/C2639959","wikidata":"https://www.wikidata.org/wiki/Q1344778","display_name":"Distance measures","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3769788","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3769788","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"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":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1986269714","https://openalex.org/W2002722727","https://openalex.org/W2112976607","https://openalex.org/W2142126162","https://openalex.org/W2602341667","https://openalex.org/W2609578772","https://openalex.org/W3008629102","https://openalex.org/W3080801325","https://openalex.org/W3102167045","https://openalex.org/W3111797900","https://openalex.org/W4385460878","https://openalex.org/W4389609954","https://openalex.org/W4391241494"],"related_works":[],"abstract_inverted_index":{"Resistance":[0],"distance":[1,34,85,124],"computation":[2,35],"is":[3],"a":[4,63,116,122,206],"fundamental":[5],"problem":[6],"in":[7,133,158,172,180,210,219,226],"graph":[8],"analysis,":[9],"yet":[10],"existing":[11],"random":[12],"walk-based":[13],"methods":[14],"are":[15],"limited":[16],"to":[17,69,98,233],"approximate":[18],"solutions":[19],"and":[20,46,96,149,177,214,223],"suffer":[21],"from":[22,94],"poor":[23],"efficiency":[24,38],"on":[25,39,89,111,198],"small-treewidth":[26,161],"graphs":[27,41,162],"(e.g.,":[28,163],"road":[29,164,202],"networks).":[30,165],"In":[31],"contrast,":[32],"shortest-path":[33],"achieves":[36],"remarkable":[37],"such":[40,234],"by":[42,50,77],"leveraging":[43],"cut":[44,57],"properties":[45],"tree":[47,79],"decompositions.":[48],"Motivated":[49],"this":[51,75],"disparity,":[52],"we":[53,73,113],"first":[54,229],"analyze":[55],"the":[56,83,92,99,102,199],"property":[58],"of":[59,101,126],"resistance":[60,84,123],"distance.":[61],"While":[62],"direct":[64],"generalization":[65],"proves":[66],"impractical":[67],"due":[68],"costly":[70],"matrix":[71],"operations,":[72],"overcome":[74],"limitation":[76],"integrating":[78],"decompositions,":[80],"revealing":[81],"that":[82,120,190],"r(s,t)":[86],"depends":[87],"only":[88],"labels":[90],"along":[91],"paths":[93],"s":[95],"t":[97],"root":[100],"decomposition.":[103],"This":[104],"insight":[105],"enables":[106],"compact":[107],"labelling":[108,125,167,209],"structures.":[109],"Based":[110],"this,":[112],"propose":[114],"TreeIndex,":[115],"novel":[117],"index":[118],"method":[119,231],"constructs":[121,205],"size":[127],"O(n":[128,134,181],"\u2022":[129,135,139,182],"h":[130,136,145,183],"G":[131,137,146,174,184],")":[132,142,175,185],"2":[138],"d":[140,150],"max":[141,151],"time,":[143],"where":[144],"(tree":[147],"height)":[148],"(maximum":[152],"degree)":[153],"behave":[154],"as":[155],"small":[156],"constants":[157],"many":[159],"real-world":[160],"Our":[166],"supports":[168],"exact":[169,216,230],"single-pair":[170,217],"queries":[171,179,218,225],"O(h":[173],"time":[176],"single-source":[178,224],"time.":[186],"Extensive":[187],"experiments":[188],"show":[189],"TreeIndex":[191],"substantially":[192],"outperforms":[193],"state-of-the-art":[194],"approaches.":[195],"For":[196],"instance,":[197],"full":[200],"USA":[201],"network,":[203],"it":[204],"405":[207],"GB":[208],"7":[211],"hours":[212],"(single-threaded)":[213],"answers":[215],"10":[220],"-3":[221],"seconds":[222],"190":[227],"seconds-the":[228],"scalable":[232],"large":[235],"graphs.":[236]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-12-06T00:00:00"}