首页> 外文OA文献 >The Thinnest Path Problem for Secure Communications: A Directed Hypergraph Approach

【2h】

The Thinnest Path Problem for Secure Communications: A Directed Hypergraph Approach

机译：安全通信的最薄路径问题：有向超图方法

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Jianhang Gao; Qing Zhao; Ananthram Swami;
展开▼
作者单位

展开▼
年度 2012
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. A directed hypergraph model for random time dependent shortest paths [J] . Daniele Pretolani European Journal of Operational Research . 2000,第2期

机译：随机时间相关的最短路径的有向超图模型
2. Robust Quantum Secure Direct Communication and Deterministic Secure Quantum Communication over Collective Dephasing Noisy Channel [J] . YUAN Hao, SONG Jun, HE Qin, 理论物理通讯：英文版 . 2008,第009期

机译：集体移相噪声通道上的稳健量子安全直接通信和确定性安全量子通信
3. Robust Quantum Secure Direct Communication and Deterministic Secure Quantum Communication over Collective Dephasing Noisy Channel [J] . YUAN Hao, SONG Jun, HE Qin, 理论物理通讯（英文版） . 2008,第009期

机译：集体移相噪声通道上的稳健量子安全直接通信和确定性安全量子通信
4. The thinnest path problem for secure communications: A directed hypergraph approach [C] . Gao Jianhang, Zhao Qing, Swami Ananthram Annual Allerton Conference on Communication, Control, and Computing . 2012

机译：安全通信的最薄路径问题：定向超图方法
5. An information theoretic approach to provably secure communications. [D] . Xu, Jin. 2010

机译：一种信息理论方法，可证明通信安全。
6. Controlled Bidirectional Quantum Secure Direct Communication [O] . Yao-Hsin Chou, Yu-Ting Lin, Guo-Jyun Zeng, -1

机译：受控双向量子安全直接通信
7. A directed hypergraph model for random time dependent shortest paths [O] . D. PRETOLANI 2000

机译：随机时间相关的最短路径的有向超图模型
8. Thinnest Path Problem for Secure Communications: A Directed Hypergraph Approach. [R] . Gao, J., Zhao, Q., Swami, A. 2012

机译：安全通信的最薄路径问题：有向超图方法。

The Thinnest Path Problem for Secure Communications: A Directed Hypergraph Approach

著录项

引文网络

相似文献

相关主题

期刊订阅