Sign in
Maximal strongly connected cliques in directed graphs: Algorithms and bounds.
Alessio Conte
Mamadou Moustapha Kanté
Takeaki Uno
Kunihiro Wasa
Published in:
Discret. Appl. Math. (2021)
Keyphrases
</>
strongly connected
directed graph
random walk
maximum flow
optimum path forest
undirected graph
significant improvement
graph structure
optimization problems
theoretical analysis
directed acyclic graph
average case
worst case
graphical models
graph theory
web graph