New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
cs.DS
Submitted: 2025-04-06
Updated: 2026-11-06
Code: https://github.com/ucrparlay/AM-tree
Terminology
Sources
- Kairos: Efficient Temporal Graph Analytics on a Single Machine
- Recent Advances in Fully Dynamic Graph Algorithms
- A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time