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
Sensor selection cost optimisation for tracking structurally cyclic systems: a P-order solution
ABSTRACT Measurements and sensing implementations impose certain cost in sensor networks. The sensor selection cost optimisation… 
Review
2015
Review
2015
Physical, chemical, and in vitro toxicological characterization of nanoparticles in chemical mechanical planarization suspensions used in the semiconductor industry: towards environmental health and…
This tutorial review focuses on aqueous slurries of dispersed engineered nanoparticles (ENPs) used in chemical mechanical… 
2015
2015
Structurally Cyclic Petri Nets
A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural… 
1997
1997
Reaching a Point with an Unanchored Robot Arm in a Square
This paper considers an unanchored n-link robot arm in a square with side length at least as long as the longest arm link. The… 
Highly Cited
1996
Highly Cited
1996
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds
1995
1995
Algorithms for Proximity Problems in Higher Dimensions
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… 
1988
1988
Some Consequences of the Decidability of the Reachability Problem for Petri Nets
  • J. Lambert
  • European Workshop on Applications and Theory of…
  • 1988
  • Corpus ID: 30752167
The aim of this article is to explain and elucidate Mayr's and Kosaraju's proof of the decidability of reachability in Petri nets… 
1985
1985
The 2-linkage problem for acyclic digraphs
Highly Cited
1980
Highly Cited
1980
One-Way Bounded Cellular Automata
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)