Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
10,727
A Strongly Connected Components
, 2009
"... 1. Find the strongly connected components in the following regulatory network, by running the strongly connected component algorithm in the lecture notes. For each gene, include the finishing time for the corresponding node in your answer, and indicate which gene leads to the discovery of each stron ..."
Abstract
- Add to MetaCart
1. Find the strongly connected components in the following regulatory network, by running the strongly connected component algorithm in the lecture notes. For each gene, include the finishing time for the corresponding node in your answer, and indicate which gene leads to the discovery of each
Strongly connected ideal languages
, 2013
"... We introduce the notion of reset left regular decomposition of an ideal regular language and we prove that there is a one-to-one correspondence between these decompositions and strongly connected synchronizing automata. We show that each ideal regular language has at least a reset left regular deco ..."
Abstract
- Add to MetaCart
We introduce the notion of reset left regular decomposition of an ideal regular language and we prove that there is a one-to-one correspondence between these decompositions and strongly connected synchronizing automata. We show that each ideal regular language has at least a reset left regular
Strongly connected graphs and polynomials
, 2011
"... In this report, we give the exact solutions ofthe equation P(A) = 0 where P is a polynomial of degree2 with integer coefficients, and A is the adjacency matrix of a strongly connected graph. Then we study the problem for P a polynomial of degree n ≥ 3, and give a necessary condition on the trace of ..."
Abstract
- Add to MetaCart
In this report, we give the exact solutions ofthe equation P(A) = 0 where P is a polynomial of degree2 with integer coefficients, and A is the adjacency matrix of a strongly connected graph. Then we study the problem for P a polynomial of degree n ≥ 3, and give a necessary condition on the trace
Strong connections on quantum principal bundles
- Commun. Math. Phys
, 1996
"... A gauge invariant notion of a strong connection is presented and characterized. It is then used to justify the way in which a global curvature form is defined. Strong connections are interpreted as those that are induced from the base space of a quantum bundle. Examples of both strong and non-strong ..."
Abstract
-
Cited by 66 (9 self)
- Add to MetaCart
A gauge invariant notion of a strong connection is presented and characterized. It is then used to justify the way in which a global curvature form is defined. Strong connections are interpreted as those that are induced from the base space of a quantum bundle. Examples of both strong and non-strong
The Strongly Connected Components of
"... We consider a random digraph Dn.uu, ln \ on vert ices l,..., n, where, lor each vertex r., we choose at random one of the n possible arcs with head l and one of the ri possible arcs with tail r'. We show that the expected size of the largesl component of D;,,.,,,,, is, ,- 2 ( * ) = + o t ..."
Abstract
- Add to MetaCart
) from D1n, Do,, and Din.os,&id assume that n is sufficiently large. In [1], Cooper and Frieze show that the probabil ity that Di,,.ou1 is strongly connected is-, 1 I- ( l- ) )- +ol l). In th is paper, we g ive an a l ternat ive proofof thei r resul t and show that the expected size of the largest
On Identifying Strongly Connected Components in Parallel
, 2000
"... . The standard serial algorithm for strongly connected components is based on depth first search, which is difficult to parallelize. We describe a divide-and-conquer algorithm for this problem which has significantly greater potential for parallelization. For a graph with n vertices in which deg ..."
Abstract
-
Cited by 33 (4 self)
- Add to MetaCart
. The standard serial algorithm for strongly connected components is based on depth first search, which is difficult to parallelize. We describe a divide-and-conquer algorithm for this problem which has significantly greater potential for parallelization. For a graph with n vertices in which
Implicit Enumeration of Strongly Connected Components
, 1999
"... This paper presents a BDD-based implicit algorithm to compute all maximal strongly connected components of directed graphs. The algorithm iteratively applies reachability analysis and sequentially identifies SCCs. Experiments suggest that the algorithm dramatically outperforms the only existing impl ..."
Abstract
-
Cited by 27 (0 self)
- Add to MetaCart
This paper presents a BDD-based implicit algorithm to compute all maximal strongly connected components of directed graphs. The algorithm iteratively applies reachability analysis and sequentially identifies SCCs. Experiments suggest that the algorithm dramatically outperforms the only existing
AN EXPLICIT FORMULA FOR A STRONG CONNECTION
, 2006
"... Abstract. An explicit formula for a strong connection form in a principal extension by a coseparable coalgebra is given. 1. In the studies of geometry of non-commutative principal bundles or coalgebra-Galois extensions (cf. [7]) an important role is played by the notion of a strong connection (for t ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract. An explicit formula for a strong connection form in a principal extension by a coseparable coalgebra is given. 1. In the studies of geometry of non-commutative principal bundles or coalgebra-Galois extensions (cf. [7]) an important role is played by the notion of a strong connection (for
On the role of strongly connected components in argumentation
- in Proceedings of International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU’04
, 2004
"... framework provides a unifying view of several alternative semantics based on the notion of extension. Recently, a new semantics has been introduced to solve the problems related to counterintuitive results produced by literature proposals. In this semantics, extensions can be decomposed and construc ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
and constructed along the strongly connected components of the defeat graph. This paper proves that this property holds also in the context of all semantics encompassed by Dung’s framework, showing that strongly connected components may play a general role in the definition and computation of argumentation
Results 1 - 10
of
10,727
