Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
Tarjan's algorithm
Description:
A graph-theory algorithm for finding strongly connected components in a directed graph.
Related topics:
Complexity and Algorithms in Graphs (19%),
Graph Theory and Algorithms (10%),
Logic, programming, and type systems (9%)
Wikidata ID:
wiki/Q1972285
OpenAlex ID:
keywords/tarjan-s-algorithm
Finding All the Elementary Circuits of a Directed Graph
1975
·
Donald B. Johnson
·
SIAM Journal on Computing
·
1,005
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
1978
·
I. S. Duff
, J. K. Reid
·
ACM Transactions on Mathematical Software
·
234
PDF
On finding the strongly connected components in a directed graph
1994
·
Esko Nuutila
, Eljas Soisalon-Soininen
·
Information Processing Letters
·
211
Path-based depth-first search for strong and biconnected components
2000
·
Harold N. Gabow
·
Information Processing Letters
·
210
A linear-time algorithm to find modules of fault trees
1996
·
Y. Dutuit
, A. Rauzy
·
IEEE Transactions on Reliability
·
184
Efficient detection of determinacy races in Cilk programs
1997
·
Mingdong Feng
, Charles E. Leiserson
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
151
PDF
Optimal decomposition by clique separators
1993
·
Hanns-Georg Leimer
·
Discrete Mathematics
·
150
PDF
BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems
2014
·
George M. Slota
, Sivasankaran Rajamanickam
, et al.
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
136
On the nlog n isomorphism technique (A Preliminary Report)
1978
·
Gary L. Miller
·
ACM Symposium on Theory of Computing (STOC)
·
134
PDF
Test Generation Derived from Model-Checking
1999
·
Thierry Jéron
, Pierre Morel
·
Lecture notes in computer science
·
113
PDF
Further Results on the Controllability of Boolean Control Networks
2018
·
Qunxi Zhu
, Yang Liu
, et al.
·
IEEE Transactions on Automatic Control
·
105
A note on finding optimum branchings
1979
·
P. M. Camerini
, L. Fratta
, et al.
·
Networks
·
102
Periodically intermittent discrete observation control for synchronization of the general stochastic complex network
2019
·
Yongbao Wu
, Sixian Zhuang
, et al.
·
Automatica
·
101
Loop Recognition in C++/Java/Go/Scala
2011
·
Robert Hundt
·
98
Computing strongly connected components in a linear number of symbolic steps
2003
·
Raffaella Gentilini
, Carla Piazza
, et al.
·
Symposium on Discrete Algorithms
·
98
Identifying loops using DJ graphs
1996
·
Vugranam C. Sreedhar
, Guang R. Gao
, et al.
·
ACM Transactions on Programming Languages and Systems
·
95
PDF
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
1986
·
Norbert Blum
·
SIAM Journal on Computing
·
69
On computing the transitive closure of a relation
1977
·
J. Eve
, R. Kurki-Suonio
·
Acta Informatica
·
67
Identifying loops in almost linear time
1999
·
G. Ramalingam
·
ACM Transactions on Programming Languages and Systems
·
66
PDF
Negative-cycle detection algorithms
1996
·
Boris V. Cherkassky
, Andrew V. Goldberg
·
Lecture notes in computer science
·
61
Tarjan’s Algorithm Makes On-the-Fly LTL Verification More Efficient
2004
·
Jaco Geldenhuys
, Antti Valmari
·
Lecture notes in computer science
·
60
PDF
Efficient Detection of Determinacy Races in Cilk Programs
1999
·
M. Feng
·
Theory of Computing Systems
·
57
Determining the Stability Number of a Graph
1977
·
V. Chvátal
·
SIAM Journal on Computing
·
57
Finding the Block Lower Triangular Form of a Sparse Matrix
1976
·
Fred Gustavson
·
Elsevier eBooks
·
57
Almost Sure Synchronization of Multilayer Networks via Intermittent Pinning Noises: A White-Noise-Based Time-Varying Coupling
2021
·
Sen Li
, Yuhang Zheng
, et al.
·
IEEE Transactions on Circuits and Systems I Regular Papers
·
55
Show more works
View as search
Works count:
188
Citation count:
4,656
Year
Topic
Type