## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Consider the following problem of single source reachability under failures of vertices or edges. Let $G$ be a given directed graph on n vertices with a designated source vertex $s$, and $k$ be any positive integer. Compute the sparsest subgraph