Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components and SSReflect [maintainers=@CohenCyril,@palmskog] ...

The Tarjan's Algorithm is a depth-first search based algorithm used to find all strongly connected components (SCCs) in a directed graph. The SCCs form subgraphs where every vertex is reachable from ...

Abstract: We present two new algorithms for finding the biconnected components of a large undirected sparse graph. The first algorithm is based on identifying articulation points and labeling edges ...