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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

An arena is a finite directed graph whose vertices are divided into two classes, i.e $V=V_{\square}\cup V_{\bigcirc}$; this forms…

2013

We present an algorithm for computing images of quadratic Julia sets that can be trusted in the sense that they contain numerical…

2012

User community recognition in social media services is important to identify hot topics or users' interests and concerns in a…

2006

We propose the recent notion of rewriting game theory as a tool for studying biochemical systems. Rewriting game theory is based…

2003

Internally, many source code analysis tools make use of graphs. For example, one of the oldest and most widely used internal…

1999

Considers the problem to update the spanning tree and strongly-connected components in response to topology change of the network…

1998

Finding the set of steady states of a machine has applications in formal verification, sequential synthesis and ATPG. Existing…

1994

In order to support the practical application of formal veri cation, a fully-automated veri cation tool has been developed which…

1989

Let Ω(N,M,Σ) be a partitioned MOS network in which the set of blocks Σ has been further partitioned into its strongly-connected…

1989

Test sequence length is an effective measure of testability of a sequential circuit. The lower the bound on the length, the more…