Corpus ID: 211096658

Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model

@article{Anderson2020WorkefficientBM,
  title={Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model},
  author={Daniel D. Anderson and Guy E. Blelloch and Kanat Tangwongsan},
  journal={ArXiv},
  year={2020},
  volume={abs/2002.05710}
}
  • Daniel D. Anderson, Guy E. Blelloch, Kanat Tangwongsan
  • Published in ArXiv 2020
  • Computer Science, Mathematics
  • 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 55 REFERENCES

    Dynamic Graphs in the Sliding-Window Model

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Parallel Tree Contraction Part 1: Fundamentals

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Analyzing graph structure via linear measurements

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    An EREW PRAM Algorithm for Updating Minimum Spanning Trees

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    An EREW PRAM fully-dynamic algorithm for MST

    • Paolo Ferragina
    • Computer Science
    • Proceedings of 9th International Parallel Processing Symposium
    • 1995
    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    An o(n) Work EREW Parallel Algorithm for Updating MST

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL