Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs.

Monika Henzinger Ami Paz A. R. Sricharan

Published in: ESA (2022)

Keyphrases

fine grained
lower bound
coarse grained
upper bound
worst case
massively parallel
access control
dynamic graph
tightly coupled
branch and bound algorithm
objective function
optimal solution
user behavior
data provenance
data lineage
average case complexity