Computing all the best swap edges distributively

被引：0

作者：

Flocchini, P ^{[1
]}

Pagli, L

Prencipe, G

Santoro, N

Widmayer, P

Zuva, T

机构：

[1] Univ Ottawa, Ottawa, ON K1N 6N5, Canada

[2] Univ Pisa, I-56100 Pisa, Italy

[3] Carleton Univ, Ottawa, ON K1S 5B6, Canada

[4] ETH, Zurich, Switzerland

[5] Univ Botswana & Swaziland, Gaborone, Botswana

来源：

PRINCIPLES OF DISTRIBUTED SYSTEMS | 2005年 / 3544卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：154 / 168

页数：15

共 12 条

[1]

DISALVO A, 2004, P 10 C STRUCT INF CO

[2]

EPPSTEIN D, 1997, CRC HDB ALGORITHMS T

[3]

FLOCCHINI P, 2004, P 3 IFIP INT C THEOR

[4] THE MULTI-TREE APPROACH TO RELIABILITY IN DISTRIBUTED NETWORKS [J].

ITAI, A ;

RODEH, M .

INFORMATION AND COMPUTATION, 1988, 79 (01) :43-59

[5]

ITO H, 2003, P 10 C STRUCT INF CO, P163

[6]

MOHANTY H, 1986, P 6 C FDN SOFTW TECH, P44

[7] Swapping a failing edge of a single source shortest paths tree is good and fast [J].

Nardelli, E ;

Proietti, G ;

Widmayer, P .

ALGORITHMICA, 2003, 35 (01) :56-74

[8]

Nardelli E., 1997, J GRAPH ALGORITHMS A, V2, P1

[9] New dynamic algorithms for shortest path tree computation [J].

Narváez, P ;

Siu, KY ;

Tzeng, HY .

IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (06) :734-746

[10]

Peterson LL, 2003, COMPUTER NETWORKS SY

← 1 2 →