No article text was recorded for this version.
edge deletion handling
Version 1 of 137 papers41 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Space Complexity of Minimum Cut Problems in Single-Pass Streams
- Blog: DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
- Blog: Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
- Blog: The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs
- Blog: Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams
- Blog: Multipass Linear Sketches for Geometric LP-Type Problems
- Blog: Frequent Subgraph Discovery in Large Attributed Streaming Graphs
- Blog: Fully-dynamic-to-incremental reductions with known deletion order (e.g. sliding window)
- Blog: Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model
- Blog: Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
- Blog: Expander Decomposition in Dynamic Streams
- Blog: Clustering High Dimensional Dynamic Data Streams
- Blog: On the Complexity of Dynamic Submodular Maximization
- Blog: 1-Pass Relative-Error Lp-Sampling with Applications
- Blog: Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model
- Blog: Streaming Algorithms with Few State Changes
- Blog: Parallel Triangle Counting in Massive Streaming Graphs
- Blog: On Streaming Algorithms for Geometric Independent Set and Clique
- Blog: Hierarchical Core Maintenance on Large Dynamic Graphs
- Blog: Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
- Blog: Reservoir Sampling over Joins
- Blog: Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams
- Blog: Communication-Optimal Distributed Dynamic Graph Clustering
- Blog: Pairwise Independent Random Walks can be Slightly Unbounded
- Blog: A Fast Sketch Method for Mining User Similarities over Fully Dynamic Graph Streams
- Blog: Dynamic Graph Stream Algorithms in o(n) Space
- Blog: Efficient Continuous Multi-Query Processing over Graph Streams
- Blog: On Estimating Maximum Matching Size in Graph Streams
- Blog: Fully Dynamic Algorithm for Constrained Submodular Optimization
- Blog: Hierarchical Heavy Hitters with the Space Saving Algorithm
- Blog: Fully Dynamic Exact Edge Connectivity in Sublinear Time
- Blog: Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
- Blog: On Sampling from Massive Graph Streams
- Blog: ComPAS: Community Preserving Sampling for Streaming Graphs
- Blog: Dynamic Algorithms for the Massively Parallel Computation Model
- Blog: Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
- Blog: A Framework for Adversarially Robust Streaming Algorithms
History & citation
Current · Permanent link
- This direction split from Structural Maintenance in Dynamic Graph Streams (62% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_edge_deletion_handling_b19567e1,
title = {edge deletion handling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/edge-deletion-handling/rdr_b19567e13ce94d6ba2385293cfc9c52e},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_edge_deletion_handling_b19567e1_v1,
title = {edge deletion handling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/edge-deletion-handling/rdr_b19567e13ce94d6ba2385293cfc9c52e/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}