Faster Algorithms for Rooted Connectivity in Directed Graphs.

Chandra Chekuri Kent Quanrud

Published in: CoRR (2021)

Keyphrases

directed graph
strongly connected
recently developed
theoretical analysis
maximum flow
computational cost
computationally efficient
orders of magnitude
computational complexity
xml documents
times faster
memory efficient
special case
highly efficient
computationally demanding