Measuring the importance of a node in a network is a major goal in the analysis of social
networks, biological systems, transportation networks etc. Different centrality measures have …

It is a major open problem whether the (\min,+)-product of two n*n matrices has a truly
subcubic (ie, O(n^3-ε) for ε>0) time algorithm; in particular, since it is equivalent to the …

Consider the following distance query for an n-node graph G undergoing edge insertions
and deletions: given two sets of nodes I and J, return the distances between every pair of …

In the sensitive distance oracle problem, there are three phases. We first preprocess a given
directed graph G with n nodes and integer weights from [-W, W]. Second, given a single …

Measuring the importance of a node in a network is a major goal in the analysis of social
networks, biological systems, transportation networks, and so forth. Different centrality …

We present a simple randomized reduction from fully-dynamic integral matching algorithms
to fully-dynamic" approximately-maximal" fractional matching algorithms. Applying this …

We study breadth-first search (BFS) spanning trees, and address the problem of designing a
sparse fault-tolerant BFS structure, or FT-BFS for short, resilient to the failure of up to two …

A k-spanner of a graph G is a sparse subgraph H whose shortest path distances match
those of G up to a multiplicative error k. In this paper we study spanners that are resistant to …

Shortest paths computation is one of the most fundamental problems in computer science.
An important variant of the problem is when edges can fail, and one needs to compute …

We present the first distance sensitivity oracle (DSO) with subcubic preprocessing time and
poly-logarithmic query time for directed graphs with integer weights in the range [− M, M] …