No article text was recorded for this version.
fully dynamic graph support
Version 1 of 127 papers33 conceptsfrozen 2026-10-04
Papers in this version
- Blog: GraphX: Graph Processing in a Distributed Dataflow Framework
- Blog: Incremental Approximate Maximum Flow via Residual Graph Sparsification
- Blog: Subspace Projection Methods for Fast Spectral Embeddings of Evolving Graphs
- Blog: A survey of dynamic graph neural networks
- Blog: Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow
- Blog: Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time
- Blog: Efficient Graph Embedding Generation and Update for Large-Scale Temporal Graph
- Blog: Dynamic influence maximization
- Blog: SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates
- Blog: Incremental 2-Edge-Connectivity in Directed Graphs
- Blog: GraphGuard: Private Time-Constrained Pattern Detection Over Streaming Graphs in the Cloud
- Blog: Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs
- Blog: Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs
- Blog: Joint Learning of Evolving Links for Dynamic Network Embedding
- Blog: Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
- Blog: Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
- Blog: DBL: Efficient Reachability Queries on Dynamic Graphs
- Blog: An Incremental Algorithm for Handling Qualitative Spatio-Temporal Information
- Blog: Incremental Strong Connectivity and 2-Connectivity in Directed Graphs
- Blog: Bootstrapping Dynamic Distance Oracles
- Blog: An Optimal Algorithm for Triangle Counting in the Stream
- Blog: Spectral Sparsification in the Semi-Streaming Setting
- Blog: Spade: A Real-Time Fraud Detection Framework
- Blog: Online Algorithms for Spectral Hypergraph Sparsification
- Blog: Multiplicative auction algorithm for approximate maximum weight bipartite matching
- Blog: Spade: A Real-Time Fraud Detection Framework on Evolving Graphs
- Blog: Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_fully_dynamic_graph_support_0722b67e,
title = {fully dynamic graph support},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fully-dynamic-graph-support/rdr_0722b67ee96e42f0b44df6ee2d387361},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_fully_dynamic_graph_support_0722b67e_v1,
title = {fully dynamic graph support},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fully-dynamic-graph-support/rdr_0722b67ee96e42f0b44df6ee2d387361/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}