{"id":"https://openalex.org/W2797929180","doi":"https://doi.org/10.1145/3313276.3316381","title":"Dynamic low-stretch trees via dynamic low-diameter decompositions","display_name":"Dynamic low-stretch trees via dynamic low-diameter decompositions","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2797929180","doi":"https://doi.org/10.1145/3313276.3316381","mag":"2797929180"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1804.04928","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sebastian Forster","orcid":null},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sebastian Forster","raw_affiliation_strings":["University of Salzburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"last","author":{"id":null,"display_name":"Gramoz Goranci","orcid":null},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Gramoz Goranci","raw_affiliation_strings":["University of Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0215,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.87455118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"377","last_page":"388"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9980000257492065,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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/tree","display_name":"Tree (set theory)","score":0.4490000009536743},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.38839998841285706},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.32710000872612},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.3183000087738037},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.27070000767707825}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7299000024795532},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6082000136375427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47859999537467957},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4490000009536743},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.38839998841285706},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.361299991607666},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.32710000872612},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.2563999891281128},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.2563000023365021}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3313276.3316381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1804.04928","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.04928","pdf_url":"https://arxiv.org/pdf/1804.04928","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1804.04928","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.04928","pdf_url":"https://arxiv.org/pdf/1804.04928","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1518157041","https://openalex.org/W1543491698","https://openalex.org/W1916091028","https://openalex.org/W1979505770","https://openalex.org/W1981859328","https://openalex.org/W1983179262","https://openalex.org/W1991838331","https://openalex.org/W2000422772","https://openalex.org/W2009695707","https://openalex.org/W2029521055","https://openalex.org/W2044246186","https://openalex.org/W2045430818","https://openalex.org/W2047517090","https://openalex.org/W2058706632","https://openalex.org/W2063860324","https://openalex.org/W2066052393","https://openalex.org/W2072142932","https://openalex.org/W2085849292","https://openalex.org/W2092534058","https://openalex.org/W2099143789","https://openalex.org/W2102560346","https://openalex.org/W2113581856","https://openalex.org/W2116055396","https://openalex.org/W2121473031","https://openalex.org/W2135927639","https://openalex.org/W2149272173","https://openalex.org/W2163098772","https://openalex.org/W2169528477","https://openalex.org/W2565540516","https://openalex.org/W2569942321","https://openalex.org/W2571471359","https://openalex.org/W2903365982","https://openalex.org/W2952708184"],"related_works":[],"abstract_inverted_index":{"Spanning":[0],"trees":[1,52],"of":[2,74,89],"low":[3],"average":[4,72],"stretch":[5,73,84],"on":[6],"the":[7,45,59,71,75,83,86],"non-tree":[8],"edges,":[9],"as":[10],"introduced":[11],"by":[12],"Alon":[13,90],"et":[14,91],"al.":[15,92],"[SICOMP":[16],"1995],":[17],"are":[18],"a":[19],"natural":[20],"graph-theoretic":[21],"object.":[22],"In":[23,40],"recent":[24],"years,":[25],"they":[26],"have":[27],"found":[28],"significant":[29],"applications":[30],"in":[31,85],"solvers":[32],"for":[33,49],"symmetric":[34],"diagonally":[35],"dominant":[36],"(SDD)":[37],"linear":[38],"systems.":[39],"this":[41],"work,":[42],"we":[43],"provide":[44],"first":[46],"dynamic":[47],"algorithm":[48,63],"maintaining":[50],"such":[51],"under":[53],"edge":[54],"insertions":[55],"and":[56,70],"deletions":[57],"to":[58],"input":[60],"graph.":[61],"Our":[62],"has":[64],"update":[65],"time":[66],"n1/2":[67],"+":[68],"o(1)":[69],"maintained":[76],"tree":[77],"is":[78],"no(1)":[79],",":[80],"which":[81],"matches":[82],"seminal":[87],"result":[88]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2018-04-24T00:00:00"}