Soumojit Sarkar

Learn More
Spanner of an undirected graph <i>G</i> = (<i>V,E</i>) is a subgraph that is sparse and yet preserves all-pairs distances approximately. More formally, a spanner with <i>stretch</i> <i>t</i> &#8712; &Nopf; is a subgraph (<i>V,E<sub>S</sub></i>), <i>E<sub>S</sub></i> &#8838; <i>E</i> such that the distance between any two vertices in the subgraph is at most(More)
Spanner of an undirected graph <i>G</i> = <i>(V, E)</i> is a sub graph which is sparse and yet preserves all-pairs distances approximately. More precisely, a spanner with <i>stretch t</i> &#8712; IN is a subgraph <i>(V, E<sub>S</sub>), E<sub>S</sub></i> &#8838; <i>E</i> such that the distance between any two vertices in the subgraph is at most <i>t</i>(More)
Spanner of an undirected graph G = (V, E) is a sub graph which is sparse and yet preserves all-pairs distances approximately. More formally, a spanner with stretch t ∈ N is a subgraph (V, ES), ES ⊆ E such that the distance between any two vertices in the subgraph is at most t times their distance in G. We present two randomized algorithms for maintaining a(More)
Let G = (V, E) be an undirected unweighted graph on |V | = n vertices and |E| = m edges. For the graph G, a spanner with stretch t is a subgraph of G with all the vertices of G in it, but a substantially sparse set of edges which preserve the property that the distance between any pair of vertices in this subgraph is at most t times the distance between(More)
  • 1