A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. The strongly connected components (SCC) of a directed graph are its maximal strongly connected subgraphs. If each strongly connected component is contracted to a single vertex, the resulting graph is a directed acyclic graph.
Kosaraju's algorithm, Tarjan's algorithm and Gabow's algorithm all efficiently compute the strongly connected components of a directed graph, but Tarjan's and Gabow's are favoured in practice since they require only one depth-first search rather than two.
US Patent Issued to Oracle America on Jan. 18 for "Graph Theory-Based Approach to Xml Data Binding" (California Inventor)
Jan 20, 2011; ALEXANDRIA, Va., Jan. 20 -- United States Patent no. 7,873,950, issued on Jan. 18, was assigned to Oracle America Inc. (Redwood...