Breadth First Search Tree and x-y Shortest Paths Tree

被引：0
|
作者：
Milkova, Eva [1 ]
机构：
[1] Univ Hradec Kralove, Fac Informat & Management, Rokitanskeho 62, Hradec Kralove 50003, Czech Republic
来源：
RECENT ADVANCES IN CIRCUITS, SYSTEMS AND SIGNALS | 2010年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
引用
收藏
页码：15 / 15
页数：1
相关论文
共 50 条
  • [41] Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game
    Bilo, Davide
    Guala, Luciano
    Proietti, Guido
    Widmayer, Peter
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2008, 5385 : 251 - +
  • [42] Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
    Di Salvo, Aleksej
    Proietti, Guido
    THEORETICAL COMPUTER SCIENCE, 2007, 383 (01) : 23 - 33
  • [43] Swapping a failing edge of a single source shortest paths tree is good and fast
    Nardelli, E
    Proietti, G
    Widmayer, P
    ALGORITHMICA, 2003, 35 (01) : 56 - 74
  • [44] Efficient truthful mechanisms for the single-source shortest paths tree problem
    Guala, L.
    Proietti, G.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2007, 19 (17): : 2285 - 2297
  • [45] Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast
    Algorithmica, 2003, 35 : 56 - 74
  • [46] Efficient truthful mechanisms for the single-source shortest paths tree problem
    Gualà, L
    Proietti, G
    EURO-PAR 2005 PARALLEL PROCESSING, PROCEEDINGS, 2005, 3648 : 941 - 951
  • [47] New Efficient Breadth-First/Level Traversal Tree Search Method for the Design and Upgrade of Sensor Networks
    Duy Quang Nguyen
    Bagajewicz, Miguel J.
    AICHE JOURNAL, 2011, 57 (05) : 1302 - 1309
  • [48] Monte Carlo tree search for dynamic shortest-path interdiction
    Bochkarev, Alexey A.
    Smith, J. Cole
    NETWORKS, 2024, 84 (04) : 398 - 419
  • [49] A fewest-turn-and-shortest path algorithm based on breadth-first search
    Zhou, Yan
    Wang, Weisheng
    He, Di
    Wang, Zhe
    GEO-SPATIAL INFORMATION SCIENCE, 2014, 17 (04) : 201 - 207
  • [50] Monte Carlo Tree Search for Finding Costly Paths in Programs
    Luckow, Kasper
    Pasareanu, Corina S.
    Visser, Willem
    SOFTWARE ENGINEERING AND FORMAL METHODS, SEFM 2018, 2018, 10886 : 123 - 138
12345