Toward <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Connectivity of the Random Graph Induced by a Pairwise Key Predistribution Scheme With Unreliable Links
From MaRDI portal
Publication:2977136
DOI10.1109/TIT.2015.2471295zbMath1359.94632arXiv1405.5193MaRDI QIDQ2977136
Faruk Yavuz, Virgil Gligor, Osman Yaǧan, Jun Zhao
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.5193
Related Items (2)
Rate of Convergence to Stationary Distribution for Unreliable Jackson-Type Queueing Network with Dynamic Routing ⋮ Analysis of Unreliable Open Queueing Network with Dynamic Routing
This page was built for publication: Toward <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Connectivity of the Random Graph Induced by a Pairwise Key Predistribution Scheme With Unreliable Links
