Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4950885 | Information Processing Letters | 2017 | 4 Pages |
Abstract
In this paper, we study a new type of graph spanners, called source-wise round-trip spanners. Given any source vertex set SâV in a directed graph G(V,E), such a spanner (with stretch k) has the property that the round-trip shortest path distance from any vertex sâS to any vertex vâV is at most k times of their round-trip distance in G. We present an algorithm to construct the source-wise round-trip spanners with stretch (2k+ϵ) and size O((k2/ϵ)ns1/klogâ¡(nw)) where n=|V|,s=|S| and w is the maximum edge weight. The result out-performs the state-of-the-art traditional round-trip spanners when the source vertex set S has small cardinality, and at the same time, it matches the traditional spanners when S is the whole vertex set V.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Chun Jiang Zhu, Kam-Yiu Lam,