Sciweavers

43 search results - page 4 / 9
» Percolation in the Secrecy Graph
Sort
View
CANDC
2006
ACM
13 years 7 months ago
Identification of functional modules in a PPI network by clique percolation clustering
Large-scale experiments and data integration have provided the opportunity to systematically analyze and comprehensively understand the topology of biological networks and biochem...
Shi-Hua Zhang, Xue-Mei Ning, Xiang-Sun Zhang
ICOIN
2007
Springer
14 years 1 months ago
A Secure Message Percolation Scheme for Wireless Sensor Network
Wireless Sensor Network (WSN) deployed in hostile environments suffers from severe security threats. In this paper, we propose a Secure Message Percolation (SMP) scheme for WSN. We...
Md. Abdul Hamid, Choong Seon Hong
RIVF
2007
13 years 8 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
WAW
2009
Springer
150views Algorithms» more  WAW 2009»
14 years 1 months ago
The Giant Component in a Random Subgraph of a Given Graph
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
Fan Chung Graham, Paul Horn, Linyuan Lu
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
13 years 7 months ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish