Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,442,029 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
2-satisfiability
Adjacency list
Adjacency matrix
Algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Probing single protein dynamics on liposome surfaces
Dongfei Ma
,
Chunhua Xu
,
+6 authors
Ming Li
2018
Corpus ID: 44117898
It is crucial to measure position and conformational changes of a membrane-interacting protein relative to the membrane surface…
Expand
2011
2011
Pattern matching in the Hamming distance with thresholds
M. Atallah
,
Timothy W. Duket
Information Processing Letters
2011
Corpus ID: 2152780
2009
2009
Secure Integrated Routing and Localization in Wireless Optical Sensor Networks
U. N. Okorafor
2009
Corpus ID: 27461399
Secure Integrated Routing and Localization in Wireless Optical Sensor Networks. (August 2008) Unoma Ndili Okorafor, B.Sc…
Expand
2002
2002
Absorption of CO2 through hollow fiber membranes using aqueous solutions of various absorbents
P. Kosaraju
2002
Corpus ID: 53842028
ABSORPTION OF CO2 THROUGH HOLLOW FIBER MEMBRANES USING AQUEOUS SOLUTIONS OF VARIOUS ABSORBENTS by Praveen Babu Kosaraju…
Expand
1996
1996
Geometric tree matching with applications to 3D lung structures
C. Pisupati
,
L. B. Wolff
,
W. Mitzner
,
E. Zerhouni
SCG '96
1996
Corpus ID: 11856447
We provide an ejjicient algorithm for the rooted binary tree isomorphism problem under the operation of graph minors (restricted…
Expand
1992
1992
An optimal algorithm for the maximum two-chain problem
R. Lou
,
M. Sarrafzadeh
,
D. T. Lee
ACM-SIAM Symposium on Discrete Algorithms
1992
Corpus ID: 15108236
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…
Expand
1989
1989
Scattered versus context-sensitive rewriting
J. Gonczarowski
,
Manfred K. Warmuth
Acta Informatica
1989
Corpus ID: 7187817
SummaryWe study the relationship between scattered and context-sensitive rewriting. We prove that an extended version of…
Expand
1988
1988
Efficient systolic algorithm for finding bridges in a connected graph
M. Zubair
,
B. B. Madan
Parallel Computing
1988
Corpus ID: 46704911
1979
1979
Algorithms on vector sets
J. Bentley
,
J. Saxe
SIGA
1979
Corpus ID: 39770170
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…
Expand
1973
1973
An Infinite Hierarchy of Linear Local Adjunct Languages
J. Hart
Information and Control
1973
Corpus ID: 22053442
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)
ACCEPT & CONTINUE