Graph Spanners in the Message-Passing Model

Manuel Fernandez
Manuel Fernandez
Taisuke Yasuda
Taisuke Yasuda

ITCS, 2020.

Cited by: 0|Bibtex|Views11|Links
EI

Abstract:

Graph spanners are sparse subgraphs which approximately preserve all pairwise shortest-path distances in an input graph. The notion of approximation can be additive, multiplicative, or both, and many variants of this problem have been extensively studied. We study the problem of computing a graph spanner when the edges of the input grap...More

Code:

Data:

Your rating :
0

 

Tags
Comments