Skip to search formSkip to main contentSkip to account menu

Kosaraju's algorithm

Known as: Kosaraju, Kosaraju algorithm 
In computer science, Kosaraju's algorithm (also known as the Kosaraju–Sharir algorithm) is a linear time algorithm to find the strongly connected… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
2-satisfiabilityAdjacency listAdjacency matrixAlgorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Local Routing in Spanners Based on WSPDs
The well-separated pair decomposition (WSPD) of the complete Euclidean graph defined on points in \(\mathbb {R}^2\) (Callahan and… 
Review
2012
Review
2012
Symposium : Children ' s Mental Health Problems and Early School : Research , Service , and Policy Issues Symposium
Four brief papers in this symposium examine clinical research, community mental health services, and policy issues of young… 
2009
2009
Secure Integrated Routing and Localization in Wireless Optical Sensor Networks
Secure Integrated Routing and Localization in Wireless Optical Sensor Networks. (August 2008) Unoma Ndili Okorafor, B.Sc… 
2007
2007
Alternating Two-Way AC-Tree Automata ⋆
We explore the notion of alternating two-way tree automata m odulo the theory of finitely many associative-commutative (AC… 
1996
1996
Geometric tree matching with applications to 3D lung structures
We provide an ejjicient algorithm for the rooted binary tree isomorphism problem under the operation of graph minors (restricted… 
1992
1992
An optimal algorithm for the maximum two-chain problem
Given a point set p, a chain is a subset C C p of points in which for any two points one is dominated by the other. A two-chain… 
1991
1991
Program Structures: Some New Characterisations
  • N. FentonR. Whitty
  • Journal of computer and system sciences (Print)
  • 1991
  • Corpus ID: 205008878
1988
1988
Efficient systolic algorithm for finding bridges in a connected graph
1984
1984
Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes
Presentation de trois problemes de decision naturels: un pour les problemes de correspondance et de grammaires CF lineaires, un… 
1982
1982
On Transforming Control Structures
Transformations of reducible flowcharts to REPEAT-EXIT or ${\text{RE}}_n $-charts and transformations of ${\text{RE}}_n $-charts… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)