Dynamic constant time parallel graph algorithms with sub-linear work.

Jonas Schmidt Thomas Schwentick

Published in: CoRR (2023)

Keyphrases

graph theory
computational complexity
theoretical analysis
learning algorithm
computational cost
depth first search
parallel processing
graph model
data structure
worst case
computationally efficient
binary images
graph structure
minimum spanning tree
parallel processors
partitioning algorithm