DeepAI AI Chat
Log In Sign Up

Roundtrip Spanners with (2k-1) Stretch

11/27/2019
by   Ruoxu Cen, et al.
Alibaba Cloud
Tsinghua University
0

A roundtrip spanner of a directed graph G is a subgraph of G preserving roundtrip distances approximately for all pairs of vertices. Despite extensive research, there is still a small stretch gap between roundtrip spanners in directed graphs and undirected spanners. For a directed graph with real edge weights in [1,W], we first propose a new deterministic algorithm that constructs a roundtrip spanner with (2k-1) stretch and O(k n^1+1/klog (nW)) edges for every integer k> 1, then remove the dependence of size on W to give a roundtrip spanner with (2k-1+o(1)) stretch and O(k n^1+1/klog n) edges. While keeping the edge size small, our result improves the previous 2k+ϵ stretch roundtrip spanners in directed graphs [Roditty, Thorup, Zwick'02; Zhu, Lam'18], and almost match the undirected (2k-1)-spanner with O(k n^1+1/k) edges [Althöfer et al. '93] which is optimal under Erdös conjecture.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/07/2022

Minimum 2-edge strongly biconnected spanning directed subgraph problem

Wu and Grumbach introduced the concept of strongly biconnected directed ...
06/22/2022

Sparse Temporal Spanners with Low Stretch

A temporal graph is an undirected graph G=(V,E) along with a function th...
02/23/2022

Clustering Edges in Directed Graphs

How do vertices exert influence in graph data? We develop a framework fo...
07/22/2019

Direction Matters: On Influence-Preserving Graph Summarization and Max-cut Principle for Directed Graphs

Summarizing large-scaled directed graphs into small-scale representation...
01/27/2019

Bipartitioning of directed and mixed random graphs

We show that an intricate relation of cluster properties and optimal bip...
08/24/2023

Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem

The Kadison-Singer Conjecture, as proved by Marcus, Spielman, and Srivas...
03/02/2023

Identifiability and Consistent Estimation of the Gaussian Chain Graph Model

The chain graph model admits both undirected and directed edges in one g...