Gabow's algorithm

E2171559 UNEXPLORED

Gabow's algorithm is a depth-first search–based method in graph theory for efficiently finding the strongly connected components of a directed graph.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label Occurrences
Gabow's algorithm canonical 1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Kosaraju's algorithm → relatedTo → Gabow's algorithm ⓘ