Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Author:
Affiliation:
1. Weizmann Institute of Science, Rehovot, Israel and Computer Science Department, Stanford University, Stanford, CA
2. Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, Israel
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference11 articles.
1. EVEN S ITAI A. AND SHAMIR A On the complexity of time-table and multicommodity flow problems SIAM J Comptng. 5 (1976) 691-703 EVEN S ITAI A. AND SHAMIR A On the complexity of time-table and multicommodity flow problems SIAM J Comptng. 5 (1976) 691-703
2. Network flow and testing graph connectivity SIAM J;EVEN S;Comping.,1975
3. HARARY F Graph Theory Addison-Wesley Reading Mass 1972. HARARY F Graph Theory Addison-Wesley Reading Mass 1972.
4. HOPCROFT J E AND TARJAN R E. Dividing a graph into trlconnected components SlAM J Comping. 2 (1973) 135-158 HOPCROFT J E AND TARJAN R E. Dividing a graph into trlconnected components SlAM J Comping. 2 (1973) 135-158
5. HOPCROFT J E. AND TARJAN R Efficient plananty testing J ACM 21 4 (Oct 1974) 549-568. 10.1145/321850.321852 HOPCROFT J E. AND TARJAN R Efficient plananty testing J ACM 21 4 (Oct 1974) 549-568. 10.1145/321850.321852
Cited by 93 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Finding Node-disjoint Paths Resilient to Channel Failures in Multi-channel Wireless Networks;2023 IEEE 98th Vehicular Technology Conference (VTC2023-Fall);2023-10-10
2. The Design of the Routing Algorithm for the Degree-Constrained Recovery Tree with the Maximum Probability;Advances in Applied Mathematics;2023
3. Design of Min-Max Disjoint Backward Hy-perpaths Algorithm in Acyclic Backward Hypergraph;Advances in Applied Mathematics;2023
4. The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs;Algorithmica;2022-12-04
5. Efficient survivable mapping algorithm for logical topology in IP-over-WDM optical networks against node failure;The Journal of Supercomputing;2022-10-07
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3