An oblivious shortest-path routing algorithm for fully connected cubic networks | |
Yang, Xiaofan[1]; Megson, Graham M.[2]; Evans, David J.[3] | |
2006 | |
卷号 | 66页码:1294-1303 |
URL标识 | 查看原文 |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/2969000 |
专题 | 重庆大学 |
推荐引用方式 GB/T 7714 | Yang, Xiaofan[1],Megson, Graham M.[2],Evans, David J.[3]. An oblivious shortest-path routing algorithm for fully connected cubic networks[J],2006,66:1294-1303. |
APA | Yang, Xiaofan[1],Megson, Graham M.[2],&Evans, David J.[3].(2006).An oblivious shortest-path routing algorithm for fully connected cubic networks.,66,1294-1303. |
MLA | Yang, Xiaofan[1],et al."An oblivious shortest-path routing algorithm for fully connected cubic networks".66(2006):1294-1303. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论