<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

Zero-one laws for connectivity in random key graphs

Loading...
Thumbnail Image

Publication or External Link

External Link to Data Files

Advisor

Citation

DRUM DOI

Abstract

The random key graph is a random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity.

Notes

Rights

Endorsement

Review

Supplemented By

Referenced By