Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Distributed consensus tracking is addressed in this paper for multi-agent systems with Lipschitz-type node dynamics. The main… Expand
  • figure 5
  • figure 2
  • figure 6
  • figure 3
  • figure 10
Is this relevant?
Highly Cited
2012
Highly Cited
2012
This paper presents three design techniques for cooperative control of multiagent systems on directed graphs, namely, Lyapunov… Expand
  • figure 1
  • figure 4
  • figure 3
  • figure 5
  • figure 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of… Expand
  • table 7.1
  • table 8.1
  • table 8.2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The standard serial algorithm for strongly connected components is based on depth first search, which is difficult to parallelize… Expand
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A quantum mechanical/molecular mechanical (QM/MM) approach based on an approximate density functional theory, the so-called self… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Community remains a potent symbol and aspiration in political and intellectual life. However, it has largely passed out of… Expand
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper we study the problem of assigning transmission ranges to the nodes of a multihop packet radio network so as to… Expand
  • figure 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Abstract We present two improved versions of Tarjan's algorithm for the detection of strongly connected components in a directed… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Abstract : This thesis applies the methodology of analysis of algorithms to study certain combinatorial problems and search… Expand
  • table 2,4
  • table 2.7
  • table 2.8
  • figure 2.1
  • figure 2.9
Is this relevant?