登录 注册 会员服务 联系我们

Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor

  • Published:2007-09 Issue:1 Volume:383 Page:23-33
  • ISSN:0304-3975
  • Container-title:Theoretical Computer Science
  • language:en
  • Short-container-title:Theoretical Computer Science

Author:

Di Salvo Aleksej,Proietti Guido

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference9 articles.

1. Davenport–Schinzel sequences and their geometric applications;Agarwal,1995

2. The level ancestor problem simplified;Bender,2002

3. Fast algorithms for finding nearest common ancestors;Harel;SIAM Journal on Computing,1984

4. Finding the upper envelope of n line segments in O(nlogn) time;Hershberger;Information Processing Letters,1989

5. Polynomial-time computable backup tables for shortest-path routing;Ito,2003

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

1. Network Convergence Analysis Using Indirect Next Hop Approach;2022 International Conference on Modern Network Technologies (MoNeTec);2022-10-27

2. Distributed and Fault-Tolerant Construction of Low Stretch Spanning Tree;2020 19th International Symposium on Parallel and Distributed Computing (ISPDC);2020-07

3. An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner;Algorithmica;2019-01-25

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

5. Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges;Structural Information and Communication Complexity;2017
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3