Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: Tarjan's strongly connected components algorithm (view)

searching for Strongly connected component 3 found (46 total)

alternate case: strongly connected component

Woodall's conjecture (615 words) [view diff] exact match in snippet view article find links to article

condensation of the instance, a graph formed by contracting each strongly connected component to a single vertex. Another class of graphs for which the theorem
Configuration model (3,077 words) [view diff] case mismatch in snippet view article find links to article
COOPER, COLIN; FRIEZE, ALAN (May 2004). "The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence". Combinatorics
Network science (10,277 words) [view diff] case mismatch in snippet view article find links to article
any node to any other, ignoring directionality of the edges. Strongly Connected Component: A collection of nodes in which there exists a directed path