Efficient and near-optimal algorithms for sampling connected subgraphs.

Marco Bressan

Browse the full STOC paper archive.