Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,209,245 papers from all fields of science
Search
Sign In
Create Free Account
Tarjan's strongly connected components algorithm
Known as:
Tarjan strongly connected components algorithm
, Tarjan's SCC algorithm
, Tarjan’s strongly connected components algorithm
Tarjan's algorithm is an algorithm in graph theory for finding the strongly connected components of a graph. It runs in linear time, matching the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
2-satisfiability
Algorithm
Directed acyclic graph
Directed graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Linear-Time Algorithm for Update Games via Trap-Alternating-Strongly-Connected Components
Carlo Comin
,
Romeo Rizzi
2016
Corpus ID: 18220243
An arena is a finite directed graph whose vertices are divided into two classes, V and V#; this forms the basic playground for a…
Expand
2016
2016
Strong Connectivity in Directed Hypergraphs and its Application to the Atomic Decomposition of Ontologies
Martin-Recuerda Moyano
,
Francisco José
2016
Corpus ID: 62310160
Directed hypergraphs are an intuitive modelling formalism that have been used in problems related to propositional logic…
Expand
2013
2013
Images of Julia sets that you can trust
L. Figueiredo
,
Diego F. Nehab
,
Nacional de Matem
,
J. Stolfi
,
Ao Batista Oliveira
2013
Corpus ID: 54971257
We present an algorithm for computing images of quadratic Julia sets that can be trusted in the sense that they contain numerical…
Expand
2013
2013
A New Push-Relabel Algorithm for the Maximum Flow Problem
Rahul Mehta
arXiv.org
2013
Corpus ID: 8910672
In this paper, we present a faster push-relabel algorithm for the maximum flow problem on bounded-degree networks with n vertices…
Expand
2012
2012
Automatic test pattern generation for asynchronous circuits
D. Vasudevan
2012
Corpus ID: 60433775
The testability of integrated circuits becomes worse with transistor dimensions re aching nanometer scales. Testing, the process…
Expand
1999
1999
A Distributed Algorithm to Update Spanning Tree and Strongly-Connected Components
Jeong-Ho Park
,
Yun-Yong Park
,
S. Choe
1999
Corpus ID: 124256251
Considers the problem to update the spanning tree and strongly-connected components in response to topology change of the network…
Expand
1994
1994
Refinements of Concurrent and Distributed Systems
Thomas Kraatz
,
M. Stange
1994
Corpus ID: 17229001
In order to support the practical application of formal veri cation, a fully-automated veri cation tool has been developed which…
Expand
1989
1989
Testability analysis of synchronous sequential circuits based on structural data
R. Hudli
,
S. Seth
Proceedings. 'Meeting the Tests of Time…
1989
Corpus ID: 15472272
Test sequence length is an effective measure of testability of a sequential circuit. The lower the bound on the length, the more…
Expand