Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work.

Jonas Schmidt Thomas Schwentick

Published in: MFCS (2023)

Keyphrases

graph theory
data structure
dynamic graph
computational complexity
depth first search
partitioning algorithm
computational cost
np complete
random walk
computationally efficient
theoretical analysis
directed graph
graph structure
maximum flow
parallel implementations
graph properties
optimal solution