An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs-Reference-Cited by-同舟云学术

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

An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs

Published:2009-05 Issue:5 Volume:36 Page:1670-1682
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Gomes Teresa,Craveirinha José,Jorge Luísa

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference17 articles.

1. Disjoint paths in networks;Suurballe;Networks,1974

2. A quick method for finding shortest pairs of disjoint paths;Suurballe;Networks,1984

3. On finding disjoint paths in single and dual link cost networks;Xu,2004

4. Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks;Laborczi,2001

5. Finding disjoint paths with different path costs: complexity and algorithms;Li;Networks,1992

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

1. One-to-one node disjoint paths on divide-and-swap cubes;International Journal of Computer Mathematics: Computer Systems Theory;2024-07-02

2. Super Spanning Connectivity of the Folded Divide-and-SwapCube;Mathematics;2023-06-05

3. Implementation of Geographic Diversity in Resilient Telecommunication Networks;Springer Proceedings in Mathematics & Statistics;2023

4. Sufficient conditions for graphs to be spanning connected;Applied Mathematics and Computation;2020-08

5. Redundancy system design for an aircraft door management system;Computers & Operations Research;2018-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP