In computer science, Kosaraju's algorithm (also known as the Kosaraju–Sharir algorithm) is a linear time algorithm to find the strongly connected… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Laurent Théry
- 2017

This notes explains how the Kosaraju’s algorithm that computes the strong-connected components of a directed graph has been… (More)

Is this relevant?

Review

2012

Review

2012

Four brief papers in this symposium examine clinical research, community mental health services, and policy issues of young… (More)

Is this relevant?

2010

2010

- Zhi Xu
- CPM
- 2010

Kosaraju in “Computation of squares in a string” briefly described a linear-time algorithm for computing the minimal squares… (More)

Is this relevant?

2008

2008

- Dexter Kozen, Wei-Lung Dustin Tseng
- MPC
- 2008

The Böhm–Jacopini theorem (Böhm and Jacopini, 1966) is a classical result of program schematology. It states that any… (More)

Is this relevant?

1999

1999

- Elizabeth Sweedyk
- SIAM J. Comput.
- 1999

Given a set of strings S = {s1, s2, . . . , sn} over a finite alphabet Σ, a superstring of S is a string that contains each si as… (More)

Is this relevant?

1999

1999

- Guo-Qiang Zhang
- Inf. Comput.
- 1999

This paper presents a Boolean-matrix-based method to automata theory, with an application to the study of regularity-preserving… (More)

Is this relevant?

1996

1996

A sublinear time subquadratic work parallel algorithm for construction of an optimal binary search tree, in a special case of… (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- S. Rao Kosaraju, Arthur L. Delcher
- AWOC
- 1988

S. Rao Kosaraju* Arthur L. Delcher Department of Computer Science Johns Hopkins University Baltimore, Maryland 21218 Abst rac t… (More)

Is this relevant?

1979

1979

- Jon Louis Bentley, James B. Saxe
- SIGA
- 1979

Hirschberg [ 1 9 7 8 a , l g 7 8 b ] and Kosaraju [ 1 9 7 9 ] have recent ly Invt~st tgated t he problem of determining whether a… (More)

Is this relevant?

1979

1979

- Kari-Jouko Räihä, Stuart H. Zweben
- Commun. ACM
- 1979

An algorithm for inserting an element into a one-sided height-balanced (OSHB) binary search tree is presented. The algorithm… (More)

Is this relevant?