Sciweavers

601 search results - page 117 / 121
» Edge-dominating cycles in graphs
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 8 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 8 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
NETWORKS
2006
13 years 8 months ago
Black hole search in common interconnection networks
Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that de...
Stefan Dobrev, Paola Flocchini, Rastislav Kralovic...
TSI
2008
129views more  TSI 2008»
13 years 8 months ago
COSMOS, composition de noeuds de contexte
Ubiquitous applications are facing a large diversity of execution contexts. However, this diversity requires some continual adaptation to preserve the correct execution of these ap...
Denis Conan, Romain Rouvoy, Lionel Seinturier
PRDC
2009
IEEE
14 years 3 months ago
Quantifying Criticality of Dependability-Related IT Organization Processes in CobiT
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
Tobias Goldschmidt, Andreas Dittrich, Miroslaw Mal...