Single backup table schemes for shortest-path routing-Reference-Cited by-同舟云学术

Single backup table schemes for shortest-path routing

Published:2005-03 Issue:3 Volume:333 Page:347-353
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Ito Hiro,Iwama Kazuo,Okabe Yasuo,Yoshihiro Takuya

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference6 articles.

1. Fully dynamic shortest paths in digraphs with arbitrary arc weights;Frigioni;J. Algorithms,2003

2. A linear-time algorithm for a special case of disjoint set union;Gabow;J. Comput. System Sci.,1985

3. H. Ito, K. Iwama, Y. Okabe, T. Yoshihiro, Polynomial-time computable backup tables for shortest-path routing, The 10th Internat. Colloq. on Structural Information and Communication Complexity (SIROCCO 2003), 2003, pp. 163–177.

4. Swapping a failing edge of a single source shortest path tree is good and fast;Nardelli;Algorithmica,2003

5. On finding lowest common ancestors;Schieber;SIAM J. Comput.,1998

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Web-based Application Design for Coal-Transportation Networks of Thermal Power Plant;2019 International Conference on Power Generation Systems and Renewable Energy Technologies (PGSRET);2019-08

2. Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks;ACM Transactions on Algorithms;2017-12-21

3. Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges;Structural Information and Communication Complexity;2017

4. A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree;IEEE Transactions on Dependable and Secure Computing;2011-01

5. Faster Swap Edge Computation in Minimum Diameter Spanning Trees;Algorithmica;2010-09-11