Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

43 relations
2-satisfiabilityAperiodic graphBüchi automatonClique (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
A distributed algorithm for solving a linear algebraic equation
A distributed algorithm is described for solving a linear algebraic equation of the form Ax = b where A is a matrix for which the… 
Highly Cited
2014
Highly Cited
2014
Distributed event-triggered coordination for average consensus on weight-balanced digraphs
Highly Cited
2012
Highly Cited
2012
Agent-Based Cloud Computing
Agent-based cloud computing is concerned with the design and development of software agents for bolstering cloud service… 
Highly Cited
2011
Highly Cited
2011
Consensus in Directed Networks of Agents With Nonlinear Dynamics
This technical note studies the consensus problem for cooperative agents with nonlinear dynamics in a directed network. Both… 
Review
2011
Review
2011
Quality early childhood education for under-two-year-olds: What should it look like? A literature review
This chapter sets the context for the commissioning of this literature review report including: the growth in participation rates… 
Highly Cited
2009
Highly Cited
2009
Supervised pattern classification based on optimum‐path forest
We present a supervised classification method which represents each class by one or more optimum‐path trees rooted at some key… 
Highly Cited
2003
Highly Cited
2003
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics
Wireless sensor networks have recently attracted lots of research effort due to the wide range of applications. These networks… 
Highly Cited
1991
Highly Cited
1991
P.L. Homeomorphic Manifolds are Equivalent by Elementary 5hellingst
  • U. Pachner
  • European journal of combinatorics (Print)
  • 1991
  • Corpus ID: 41983257
Highly Cited
1980
Highly Cited
1980
Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis
A study of questions raised by the conception of a tool for computer-aided decision analysis that would facilitate interactive… 
Highly Cited
1979
Highly Cited
1979
Performance measurement and analysis of certain search algorithms.
Abstract : This thesis applies the methodology of analysis of algorithms to study certain combinatorial problems and search… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)