{
"id": "2002.05710",
"version": "v1",
"published": "2020-02-13T18:51:07.000Z",
"updated": "2020-02-13T18:51:07.000Z",
"title": "Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model",
"authors": [
"Daniel Anderson",
"Guy E. Blelloch",
"Kanat Tangwongsan"
],
"categories": [
"cs.DS",
"cs.DC"
],
"abstract": "Algorithms for dynamically maintaining minimum spanning trees (MSTs) have received much attention in both the parallel and sequential settings. While previous work has given optimal algorithms for dense graphs, all existing parallel batch-dynamic algorithms perform polynomial work per update in the worst case for sparse graphs. In this paper, we present the first work-efficient parallel batch-dynamic algorithm for incremental MST, which can insert $\\ell$ edges in $O(\\ell \\log(1+n/\\ell))$ work in expectation and $O(\\text{polylog}(n))$ span w.h.p. The key ingredient of our algorithm is an algorithm for constructing a compressed path tree of an edge-weighted tree, which is a smaller tree that contains all pairwise heaviest edges between a given set of marked vertices. Using our batch-incremental MST algorithm, we demonstrate a range of applications that become efficiently solvable in parallel in the sliding-window model, such as graph connectivity, approximate MSTs, testing bipartiteness, $k$-certificates, cycle-freeness, and maintaining sparsifiers.",
"revisions": [
{
"version": "v1",
"updated": "2020-02-13T18:51:07.000Z"
}
],
"analyses": {
"keywords": [
"work-efficient batch-incremental minimum spanning trees",
"sliding window model",
"algorithms perform polynomial",
"work-efficient parallel batch-dynamic algorithm",
"parallel batch-dynamic algorithms perform"
],
"note": {
"typesetting": "TeX",
"pages": 0,
"language": "en",
"license": "arXiv",
"status": "editable"
}
}
}