CONSTRUCTION OF CENTERED SHORTEST-PATH TREES IN NETWORKS

被引:5
|
作者
WALL, DW [1 ]
OWICKI, S [1 ]
机构
[1] STANFORD UNIV,STANFORD,CA 94305
关键词
D O I
10.1002/net.3230130206
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:207 / 231
页数:25
相关论文
共 50 条
  • [1] A NOTE ON FINDING SHORTEST-PATH TREES
    KERSHENBAUM, A
    [J]. NETWORKS, 1981, 11 (04) : 399 - 400
  • [2] Joint distributions for total lengths of shortest-path trees in telecommunication networks
    David Neuhäuser
    Christian Hirsch
    Catherine Gloaguen
    Volker Schmidt
    [J]. annals of telecommunications - annales des télécommunications, 2015, 70 : 221 - 232
  • [3] Comparative visualizations of transport networks in Calgary using shortest-path trees
    Allen, Jeff J.
    [J]. ENVIRONMENT AND PLANNING A-ECONOMY AND SPACE, 2018, 50 (01): : 9 - 13
  • [4] Joint distributions for total lengths of shortest-path trees in telecommunication networks
    Neuhaeuser, David
    Hirsch, Christian
    Gloaguen, Catherine
    Schmidt, Volker
    [J]. ANNALS OF TELECOMMUNICATIONS, 2015, 70 (5-6) : 221 - 232
  • [5] Indexing Network Structure with Shortest-Path Trees
    Maier, Marc
    Rattigan, Matthew
    Jensen, David
    [J]. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2011, 5 (03)
  • [6] BALANCING MINIMUM SPANNING-TREES AND SHORTEST-PATH TREES
    KHULLER, S
    RAGHAVACHARI, B
    YOUNG, N
    [J]. ALGORITHMICA, 1995, 14 (04) : 305 - 321
  • [7] Shortest-Path Percolation on Random Networks
    Kim, Minsuk
    Radicchi, Filippo
    [J]. Physical Review Letters, 2024, 133 (04)
  • [8] Shortest-Path Queries in Static Networks
    Sommer, Christian
    [J]. ACM COMPUTING SURVEYS, 2014, 46 (04)
  • [9] Shortest-path routing in arbitrary networks
    auf der Heide, FM
    Vöcking, B
    [J]. JOURNAL OF ALGORITHMS, 1999, 31 (01) : 105 - 131
  • [10] Fault-Tolerant Approximate Shortest-Path Trees
    Bilo, Davide
    Guala, Luciano
    Leucci, Stefano
    Proietti, Guido
    [J]. ALGORITHMS - ESA 2014, 2014, 8737 : 137 - 148