Strongly connected component

Known as: Strongly Connected Components, Strongly connected, Condensation (disambiguation) 
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We consider the problem of maintaining the strongly connected components (SCCs) of an n-nodes and medges directed graph that… (More)
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We study the average consensus problem of multi-agent syste ms for general network topologies with unidirectional information… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The problem of decomposing a directed graph into its strongly connected components is a fundamental graph problem inherently… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 3
Is this relevant?
2008
2008
This paper presents the method of a parallel implementation of Tarjan’s algorithm that solves an important problem of detection… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present an algorithm that computes in a linear number of symbolic steps (<i>O</i>(|<i>V</i>|)) the strongly connected… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We… (More)
  • figure 1
Is this relevant?
1999
1999
This paper presents a BDD-based implicit algorithm to compute all maximal strongly connected components of directed graphs. The… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
In this paper we present a CTL-like logic which is interpreted over the state spaces of Coloured Petri Nets. The logic has been… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We present two improved versions of Tarjan's algorithm for the detection of strongly connected components in a directed graph… (More)
Is this relevant?