No article text was recorded for this version.
dynamic graph maintenance
Version 1 of 11,582 papers2,393 conceptsfrozen 2026-10-04
Papers in this version
- Blog: DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs
- Blog: Change-Sensitive Algorithms for Maintaining Maximal Cliques in a Dynamic Graph
- Blog: DDSL: Efficient Subgraph Listing on Distributed and Dynamic Graphs
- Blog: Dynamic Spectral Clustering with Provable Approximation Guarantee
- Blog: Incremental Lossless Graph Summarization
- Blog: DSPC: Efficiently Answering Shortest Path Counting on Dynamic Graphs
- Blog: Efficient Core Maintenance in Large Dynamic Graphs
- Blog: DDSL: Efficient Subgraph Listing on Distributed and Dynamic Graphs
- Blog: DBL: Efficient Reachability Queries on Dynamic Graphs
- Blog: Incremental Reachability Index
- Blog: Spade: A Real-Time Fraud Detection Framework
- Blog: Regular Path Query Evaluation on Streaming Graphs
- Blog: Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks
- Blog: Efficient Data Structures for Incremental Exact and Approximate Maximum Flow
- Blog: Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme
- Blog: Sensitive Distance and Reachability Oracles for Large Batch Updates
- Blog: Fully Dynamic Betweenness Centrality Maintenance on Massive Networks
- Blog: GraphOne: A Data Store for Real-time Analytics on Evolving Graphs
- Blog: Incremental 2-Edge-Connectivity in Directed Graphs
- Blog: CommonGraph: Graph Analytics on Evolving Data (Abstract)
- Blog: Dynamic Influence Analysis in Evolving Networks
- Blog: Approximate Personalized PageRank on Dynamic Graphs
- Blog: BatchHL+: batch dynamic labelling for distance queries on large-scale networks
- Blog: A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph
- Blog: GNNFlow: A Distributed Framework for Continuous Temporal GNN Learning on Dynamic Graphs
- Blog: Dynamic Algorithms for Submodular Matching
- Blog: Fully Dynamic (Δ+1) Coloring Against Adaptive Adversaries
- Blog: An In-Depth Study of Continuous Subgraph Matching (Complete Version)
- Blog: Accelerating Dynamic Graph Analytics on GPUs
- Blog: GraphSnapShot: Graph Machine Learning Acceleration with Fast Storage and Retrieval
- Blog: Incremental Sliding Window Connectivity over Streaming Graphs
- Blog: On Dynamic α + 1 Arboricity Decomposition and Out-Orientation
- Blog: Maximal D-truss Search in Dynamic Directed Graphs
- Blog: Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
- Blog: Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach
- Blog: Fast Computation for the Forest Matrix of an Evolving Graph
- Blog: Near-Optimal Decremental Approximate Multi-Source Shortest Paths
- Blog: Dynamic Metric Embedding into ℓp Space
- Blog: Scalable Graph Condensation with Evolving Capabilities
- Blog: Efficient Community Detection Over Streaming Bipartite Networks (Technical Report)
- Blog: Efficient Maintenance of Highway Cover Labelling for Distance Queries on Large Dynamic Graphs
- Blog: Incremental measurement of structural entropy for dynamic graphs
- Blog: Leveraging Temporal Graph Networks Using Module Decoupling
- Blog: MV4PG: Materialized Views for Property Graphs
- Blog: Efficient Maintenance of Distance Labelling for Incremental Updates in Large Dynamic Graphs
- Blog: iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
- Blog: The future is big graphs: a community view on graph processing systems
- Blog: Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
- Blog: Dynamic Steiner Tree in Planar Graphs
- Blog: Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs
- Blog: An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs
- Blog: On Dynamic Parameterized k-Path
- Blog: Layph: Making Change Propagation Constraint in Incremental Graph Processing by Layering Graph
- Blog: MetricForensics: A Multi-Level Approach for Mining Volatile Graphs
- Blog: BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale
- Blog: Efficient Maintenance of Distance Labelling for Incremental Updates in Large Dynamic Graphs
- Blog: Dynamic Structural Clustering on Graphs
- Blog: Incremental Spectral Clustering with the Normalised Laplacian
- Blog: GastCoCo: Graph Storage and Coroutine-Based Prefetch Co-Design for Dynamic Graph Processing
- Blog: TEGRA: Efficient Ad-Hoc Analytics on Evolving Graphs
Showing 60 of 1,582 papers.
History & citation
Current · Permanent link
- Semi-External Memory for Billion Node Graph Processing merged into this direction (53% overlap)
- Incremental Maintenance of Graph Based Search Indices merged into this direction (78% overlap)
- Structural Batching for Dynamic Graph Updates merged into this direction (63% overlap)
- Multi-Query Optimization through Shared Intermediate Results merged into this direction (56% overlap)
- Breaking Complexity Barriers in Dynamic Graph Algorithms merged into this direction (75% overlap)
- Scalable Reachability Indexing for Massive Graphs merged into this direction (59% overlap)
- Pruned Landmark Labeling for Scalable Graph Distance Queries merged into this direction (57% overlap)
- Incremental Maintenance of Structural Properties in Dynamic Graphs merged into this direction (68% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_dynamic_graph_maintenance_847edd6e,
title = {dynamic graph maintenance},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/dynamic-graph-maintenance/rdr_847edd6e36454582be5fdc4487913d05},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_dynamic_graph_maintenance_847edd6e_v1,
title = {dynamic graph maintenance},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/dynamic-graph-maintenance/rdr_847edd6e36454582be5fdc4487913d05/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}