{"id":"https://openalex.org/W2055518297","doi":"https://doi.org/10.1145/2723372.2723717","title":"Minimum Spanning Trees in Temporal Graphs","display_name":"Minimum Spanning Trees in Temporal Graphs","publication_year":2015,"publication_date":"2015-05-27","ids":{"openalex":"https://openalex.org/W2055518297","doi":"https://doi.org/10.1145/2723372.2723717","mag":"2055518297"},"language":"en","primary_location":{"id":"doi:10.1145/2723372.2723717","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2723372.2723717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-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/A5090828085","display_name":"Silu Huang","orcid":"https://orcid.org/0000-0002-5291-0167"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Silu Huang","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110164824","display_name":"Ada Wai-Chee Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ada Wai-Chee Fu","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100738739","display_name":"Ruifeng Liu","orcid":"https://orcid.org/0000-0002-3063-7673"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruifeng Liu","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090828085"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":3.3282,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.92927214,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"419","last_page":"430"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998000264167786,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998000264167786,"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/T11478","display_name":"Caching and Content Delivery","score":0.9993000030517578,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6870477199554443},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6497188210487366},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.642156183719635},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6305171847343445},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.598533570766449},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5488078594207764},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5350512266159058},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.47437959909439087},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43276745080947876},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4180715084075928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38346612453460693},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36001890897750854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23625648021697998},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19548249244689941}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6870477199554443},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6497188210487366},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.642156183719635},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6305171847343445},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.598533570766449},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5488078594207764},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5350512266159058},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.47437959909439087},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43276745080947876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4180715084075928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38346612453460693},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36001890897750854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23625648021697998},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19548249244689941},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2723372.2723717","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2723372.2723717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W114870970","https://openalex.org/W1518080829","https://openalex.org/W1578473173","https://openalex.org/W1746637951","https://openalex.org/W1864844333","https://openalex.org/W1965680834","https://openalex.org/W1972969203","https://openalex.org/W1982512167","https://openalex.org/W1984069252","https://openalex.org/W1984196269","https://openalex.org/W1986201860","https://openalex.org/W1988615825","https://openalex.org/W1999823999","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2017927472","https://openalex.org/W2034887891","https://openalex.org/W2035040468","https://openalex.org/W2040579873","https://openalex.org/W2061820396","https://openalex.org/W2086991377","https://openalex.org/W2096389124","https://openalex.org/W2121947440","https://openalex.org/W2125349172","https://openalex.org/W2127284416","https://openalex.org/W2143391442","https://openalex.org/W2146456494","https://openalex.org/W2172222998","https://openalex.org/W2244843312","https://openalex.org/W3037819556","https://openalex.org/W3148632216","https://openalex.org/W4246185962","https://openalex.org/W4252678302","https://openalex.org/W6780631547"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"The":[0],"computation":[1],"of":[2,21,43,55,126,135],"Minimum":[3],"Spanning":[4],"Trees":[5],"(MSTs)":[6],"is":[7,27,33,74,133],"a":[8,84,102],"fundamental":[9],"graph":[10],"problem":[11,91,100],"with":[12,101],"important":[13],"applications.":[14],"However,":[15],"there":[16],"has":[17],"been":[18],"little":[19],"study":[20],"MSTs":[22,44],"for":[23,35,45,66],"temporal":[24,46,120],"graphs,":[25,47],"which":[26],"becoming":[28],"common":[29],"as":[30],"time":[31,56,64,104],"information":[32],"collected":[34],"many":[36],"existing":[37],"networks.":[38],"We":[39,60,69,77],"define":[40],"two":[41],"types":[42],"MSTa":[48],"and":[49,57,106],"MSTw,":[50,130],"based":[51,82],"on":[52,83,118],"the":[53,87,97,107,113,124,137],"optimization":[54],"cost,":[58],"respectively.":[59],"propose":[61],"efficient":[62,79],"linear":[63],"algorithms":[65,81],"computing":[67,72],"MSTa.":[68],"show":[70],"that":[71],"MSTw":[73],"much":[75],"harder.":[76],"design":[78],"approximation":[80,109],"transformation":[85],"to":[86,112,142],"Directed":[88],"Steiner":[89],"Tree":[90],"(DST).":[92],"Our":[93,116],"solution":[94,132],"also":[95],"solves":[96],"classical":[98],"DST":[99],"better":[103],"complexity":[105],"same":[108],"factor":[110],"compared":[111],"state-of-the-art":[114],"algorithm.":[115],"experiments":[117],"real":[119],"networks":[121],"further":[122],"verify":[123],"effectiveness":[125],"our":[127,131],"algorithms.":[128],"For":[129],"capable":[134],"shortening":[136],"runtime":[138],"from":[139],"10":[140],"hours":[141],"3":[143],"seconds.":[144]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}