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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In wireless sensor networks, Virtual Backbone (VB) construction based on connected dominating set is a competitive issue for… 
Review
2011
Review
2011
This report gives a language definition and tutorial on how to model languages using MetaModelica 2.0 – an extension of Modelica… 
2010
2010
Finding strongly connected components (SCCs) in the state-space of discrete-state models is a critical task in formal… 
2004
2004
In argumentation theory, Dung’s abstract framework provides a unifying view of several alternative semantics based on the notion… 
Review
2002
Review
2002
The purpose of this study was to determine whether there is a need for better tourism information on a portable media like a PDA… 
1998
1998
We present in this paper a parallel execution model of arc-consistency for Constraint Satisfaction Problems (CSP), implemented on… 
1997
1997
This paper is concerned with multiprocessor implementations of embedded applications specified as iterative dataflow programs in… 
1995
1995
Synchronization overhead can significantly degrade performance in embedded multiprocessor systems. This paper develops techniques… 
1962
1962
This paper is mot iva ted by Fleck's s tudy [1] on certain classes of structurepreserving, nontrivial t ransformations of au…