Strong Connectivity in Directed Graphs under Failures, with Applications.

Loukas Georgiadis Giuseppe F. Italiano Nikos Parotsidis

Published in: SIAM J. Comput. (2020)

Keyphrases

directed graph
strongly connected
random walk
undirected graph
graph structure
connected components
data sets
maximum flow
directed acyclic graph
directed edges
disjoint paths
graph structures
search algorithm
objective function
information systems
genetic algorithm
machine learning
neural network