Searching for "On Finding the Strongly Connected Components in a Directed Graph." – sorted by Relevance.
14 documents found, showing 1 through 10.
Next 10 →
-
On Finding the Strongly Connected Components in a Directed Graph
- …On Finding the Strongly Connected Components in a Directed Graph Esko Nuutila Eljas Soisalon…
- Cited by 14 (3 self) – Add To MetaCart
-
An improved algorithm for finding the strongly connected components of a directed graph
- …An Improved Algorithm for Finding the Strongly Connected Components of a Directed Graph David J…
- Cited by 1 (0 self) – Add To MetaCart
-
Improving Discrete Mathematics and Algorithms Curricula with LINK
- …, which finds the strongly connected components 1 of a directed graph G = (V; E) given in Corman…
- Cited by 8 (3 self) – Add To MetaCart
-
On the Computation of Fixpoints in Static Program Analysis with an Application to Analysis of AKL
- … of Tarjan's algorithm for finding the strongly connected components of a directed graph. This report…
- Cited by 2 (0 self) – Add To MetaCart
-
unknown title
- … the strongly con-nected components 1 of a directed graph G = (V; E) given inCorman, Leiserson, & Rivest's well…
- Add To MetaCart
-
Permanents, Pfaffian Orientations, And Even Directed Circuits (Extended Abstract)
- … connected components of a directed graph (see [6]), and hence can be done in time O(n2 ). Step 3. If G…
- Cited by 2 (1 self) – Add To MetaCart
-
Testing Satisfiability Of A Conjunction Of Inequalities
- … connected components of a directed graph when edges are considered in G 2 . Then a 6= edge is searched…
- Add To MetaCart
-
Generating Compact Code From Dataflow Specifications Of Multirate Signal Processing Algorithms
- … the strongly connected components of a directed graph. Let A 3 be any algorithm that takes an acyclic SDF graph…
- Cited by 22 (15 self) – Add To MetaCart
-
Search Trees Elementary Graph Algorithms
- …. A second application of depth-first search, finding the strongly connected components of a directed…
- Add To MetaCart
-
An efficient algorithm for branching bisimulation and stuttering equivalence
- … for finding strongly connected components in a directed graph (see for instance Aho, Hopcroft and Ullman [1…
- Cited by 47 (2 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
