= S. Rao Kosaraju
{wiki=S._Rao_Kosaraju}
S. Rao Kosaraju is an Indian computer scientist renowned for his contributions to algorithms and theoretical computer science, particularly in the field of graph algorithms. He is best known for developing the Kosaraju's algorithm, which efficiently finds strongly connected components in a directed graph. This algorithm operates in linear time, making it one of the fundamental techniques used in graph theory and related applications. Kosaraju's work has had a significant impact on both academic research and practical applications in computer science.
Back to article page