Average Sensitivity of Graph Algorithms.

Nithin Varma Yuichi Yoshida

Published in: SIAM J. Comput. (2023)

Keyphrases

graph theory
significant improvement
learning algorithm
times faster
breadth first search
depth first search
theoretical analysis
maximum clique
maximum flow
optimization problems
sensitivity analysis
bipartite graph
connected components
directed acyclic graph
random walk
worst case
planar graphs
computational cost