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.
2012
2012
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
2009
2009
Avaliação de indicadores inflamatórios no diagnóstico da mastite bovina
The aim of this trial was to evaluate and compare the distinct indictors of inflammation in the diagnosis of mastitis. The… 
2006
2006
Average Consensus in Directed Networks of Dynamic Agents with Time-Varying Communication Delays
In this paper, we discuss average consensus problem in directed networks of dynamic agents with fixed, switching, or dynamically… 
2003
2003
Performance modelling with the Unified Modelling Language and stochastic process algebras
A software toolset which allows unified modelling language (UML) modellers to annotate models with performance information is… 
Highly Cited
2002
Highly Cited
2002
Process nets with resources for manufacturing modeling and their analysis
This paper presents a new class of Petri nets, called process nets with resources (PNRs), for modeling manufacturing systems… 
2002
2002
Shape Connectivity: Multiscale Analysis and Application to Generalized Granulometries
This paper develops a multiscale connectivity theory for shapes based on the axiomatic definition of new generalized connectivity… 
1999
1999
Implicit enumeration of strongly connected components
  • A. XieP. Beerel
  • IEEE/ACM International Conference on Computer…
  • 1999
  • Corpus ID: 9939865
This paper presents a binary decision diagram (BDD) based implicit algorithm to compute all maximal strongly connected components… 
Highly Cited
1999
Highly Cited
1999
Analysis of modularly composed nets by siphons
This paper uses siphons to analyze the class of Petri nets constructed by a modular approach by Jeng and DiCesare (1995) for… 
1995
1995
The p-Competition Graphs of Strongly Connected and Hamiltonian Digraphs
A radio communication network can be modeled by a digraph, $D$, where there is an arc from vertex $x$ to vertex $y$ if a signal… 
1962
1962
The Structure of an Automaton and Its Operation-Preserving Transformation Group
This paper is mot iva ted by Fleck's s tudy [1] on certain classes of structurepreserving, nontrivial t ransformations of au… 
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)