On the [+1]-link-prior shortest path and optimal routing for double-loop networks

被引：0
|
作者：
机构：
来源：
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2001年 / 38卷 / 07期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] A complementary survey on double-loop networks
    Hwang, FK
    THEORETICAL COMPUTER SCIENCE, 2001, 263 (1-2) : 211 - 229
  • [32] Optimal routing in shortest-path data
    Ramakrishnan, KG
    Rodrigues, MA
    BELL LABS TECHNICAL JOURNAL, 2001, 6 (01) : 117 - 138
  • [33] Shortest Path for Optimal Routing on Advanced Metering Infrastructure using Cellular Networks
    Inga, Esteban
    Hincapie, Roberto
    Suarez, Carlos
    Arevalo, German
    2015 IEEE COLOMBIAN CONFERENCE ON COMMUNICATIONS AND COMPUTING (COLCOM), 2015,
  • [34] On infinite families of optimal double-loop networks with non-unit steps
    Zhou, Jianqin
    Xu, Xirong
    ARS COMBINATORIA, 2010, 97A : 81 - 95
  • [35] On construction of infinite families of k-tight optimal double-loop networks
    Zhou, Jianqin
    ARS COMBINATORIA, 2009, 91 : 53 - 64
  • [36] An algorithm to find optimal double-loop networks with non-unit steps
    Dai, Xiaoping
    Zhou, Iianqin
    Wang, Kaihou
    ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS, 2007, 4847 : 352 - +
  • [37] Some new optimal and suboptimal infinite families of undirected double-loop networks
    Chen, Bao-Xing
    Meng, Ji-Xiang
    Xiao, Wen-Jun
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2006, 8 (01): : 299 - 311
  • [38] Shortest-path routing in arbitrary networks
    auf der Heide, FM
    Vöcking, B
    JOURNAL OF ALGORITHMS, 1999, 31 (01) : 105 - 131
  • [39] Optimal routing algorithm for double loop networks with restricted steps
    Chen, Xie-Bin
    Jisuanji Xuebao/Chinese Journal of Computers, 2004, 27 (05): : 596 - 603
  • [40] ON THE AVERAGE DIAMETER OF DIRECTED DOUBLE-LOOP NETWORKS
    Li, Sheng
    2011 INTERNATIONAL CONFERENCE ON INSTRUMENTATION, MEASUREMENT, CIRCUITS AND SYSTEMS (ICIMCS 2011), VOL 2: FUTURE COMMUNICATION AND NETWORKING, 2011, : 361 - 365
12345