Concurrent Dynamic SSSP: Related Work
- DYNAMIC GRAPH OPERATIONS: A CONSISTENT NON-BLOCKING APPROACH
- Wait-Free Concurrent Graph Objects with Dynamic Traversals
- A Shared-Memory Algorithm for Updating Single-Source Shortest Paths in Large Weighted Dynamic Networks
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- A single-source shortest path algorithm for dynamic graphs
A single-source shortest path algorithm for dynamic graphs
Wait-Free Concurrent Graph Objects with Dynamic Traversals
1. announce
2. agree
3. apply
- Lightweight helping
DYNAMIC GRAPH OPERATIONS:
A CONSISTENT NON-BLOCKING APPROACH
DYNAMIC GRAPH OPERATIONS:
A CONSISTENT NON-BLOCKING APPROACH
A Shared-Memory Algorithm for Updating Single-Source Shortest Paths in Large Weighted Dynamic Networks
1. Identify Changed Edges that Affect the SSSP
2. Update The Subgraphs of the Affected Vertices
A Shared-Memory Algorithm for Updating Single-Source Shortest Paths in Large Weighted Dynamic Networks
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
