Sparse Temporal Spanners with Low Stretch

Davide Bilò, Gianlorenzo D'angelo, Luciano Gualà, S. Leucci, Mirko Rossi
{"title":"Sparse Temporal Spanners with Low Stretch","authors":"Davide Bilò, Gianlorenzo D'angelo, Luciano Gualà, S. Leucci, Mirko Rossi","doi":"10.48550/arXiv.2206.11113","DOIUrl":null,"url":null,"abstract":"A temporal graph is an undirected graph G = ( V, E ) along with a function λ : E → N + that assigns a time-label to each edge in E . A path in G such that the traversed time-labels are non-decreasing is called temporal path . Accordingly, the distance from u to v is the minimum length (i.e., the number of edges) of a temporal path from u to v . A temporal α -spanner of G is a (temporal) subgraph H that preserves the distances between any pair of vertices in V , up to a multiplicative stretch factor of α . The size of H is measured as the number of its edges. In this work, we study the size-stretch trade-offs of temporal spanners. In particular we show that temporal cliques always admit a temporal (2 k − 1) − spanner with (cid:101) O ( kn 1+ 1 k ) edges, where k > 1 is an integer parameter of choice. Choosing k = (cid:98) log n (cid:99) , we obtain a temporal O (log n )-spanner with (cid:101) O ( n ) edges that has almost the same size (up to logarithmic factors) as the temporal spanner given in [Casteigts et al., JCSS 2021] which only preserves temporal connectivity. We then turn our attention to general temporal graphs. Since Ω( n 2 ) edges might be needed by any connectivity-preserving temporal subgraph [Axiotis et al., ICALP’16], we focus on approximating distances from a single source . We show that (cid:101) O ( n/ log(1 + ε )) edges suffice to obtain a stretch of (1 + ε ), for any small ε > 0. This result is essentially tight in the following sense: there are temporal graphs G for which any temporal subgraph preserving exact distances from a single-source must use Ω( n 2 ) edges. Interestingly enough, our analysis can be extended to the case of additive stretch for which we prove an upper bound of (cid:101) O ( n 2 /β ) on the size of any temporal β -additive spanner, which we show to be tight up to polylogarithmic factors. Finally, we investigate how the lifetime of G , i.e., the number of its distinct time-labels, affects the trade-off between the size and the stretch of a temporal spanner.","PeriodicalId":201778,"journal":{"name":"Embedded Systems and Applications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Embedded Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2206.11113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

A temporal graph is an undirected graph G = ( V, E ) along with a function λ : E → N + that assigns a time-label to each edge in E . A path in G such that the traversed time-labels are non-decreasing is called temporal path . Accordingly, the distance from u to v is the minimum length (i.e., the number of edges) of a temporal path from u to v . A temporal α -spanner of G is a (temporal) subgraph H that preserves the distances between any pair of vertices in V , up to a multiplicative stretch factor of α . The size of H is measured as the number of its edges. In this work, we study the size-stretch trade-offs of temporal spanners. In particular we show that temporal cliques always admit a temporal (2 k − 1) − spanner with (cid:101) O ( kn 1+ 1 k ) edges, where k > 1 is an integer parameter of choice. Choosing k = (cid:98) log n (cid:99) , we obtain a temporal O (log n )-spanner with (cid:101) O ( n ) edges that has almost the same size (up to logarithmic factors) as the temporal spanner given in [Casteigts et al., JCSS 2021] which only preserves temporal connectivity. We then turn our attention to general temporal graphs. Since Ω( n 2 ) edges might be needed by any connectivity-preserving temporal subgraph [Axiotis et al., ICALP’16], we focus on approximating distances from a single source . We show that (cid:101) O ( n/ log(1 + ε )) edges suffice to obtain a stretch of (1 + ε ), for any small ε > 0. This result is essentially tight in the following sense: there are temporal graphs G for which any temporal subgraph preserving exact distances from a single-source must use Ω( n 2 ) edges. Interestingly enough, our analysis can be extended to the case of additive stretch for which we prove an upper bound of (cid:101) O ( n 2 /β ) on the size of any temporal β -additive spanner, which we show to be tight up to polylogarithmic factors. Finally, we investigate how the lifetime of G , i.e., the number of its distinct time-labels, affects the trade-off between the size and the stretch of a temporal spanner.
具有低拉伸的稀疏时间扳手
时间图是一个无向图G = (V, E)和一个函数λ: E→N +,它为E中的每条边分配一个时间标签。在G中,使所经过的时间标签不递减的路径称为时间路径。因此,从u到v的距离是从u到v的时间路径的最小长度(即边的数量)。G的时间α -扳手是一个(时间)子图H,它保留了V中任何一对顶点之间的距离,直到乘以α的拉伸因子。H的大小是用它的边的数量来衡量的。在这项工作中,我们研究了时间扳手的尺寸-拉伸权衡。特别地,我们证明了时间团总是允许具有(cid:101) O (kn 1+ 1k)条边的时间(2k−1)−扳手,其中k > 1是可选择的整数参数。选择k = (cid:98) log n (cid:99),我们得到一个具有(cid:101) O (n)条边的时间O (log n)扳手,其大小几乎与[Casteigts et al., JCSS 2021]中给出的时间扳手相同(高达对数因子),仅保留时间连通性。然后我们把注意力转向一般的时间图。由于任何保持连通性的时间子图都可能需要Ω(n 2)条边[Axiotis等人,ICALP ' 16],因此我们专注于逼近与单个源的距离。我们证明了(cid:101) O (n/ log(1 + ε))条边足以得到(1 + ε)的拉伸,对于任何小的ε > 0。这个结果在以下意义上本质上是紧密的:存在时间图G,其中任何与单一源保持精确距离的时间子图必须使用Ω(n 2)边。有趣的是,我们的分析可以扩展到加性拉伸的情况,我们证明了任何时间β -加性扳手大小的上界(cid:101) O (n 2 /β),我们证明了它与多对数因子紧密相关。最后,我们研究了G的寿命,即其不同时间标签的数量,如何影响时间扳手大小和拉伸之间的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信