Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph-Reference-Cited by-同舟云学术

Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph

Published:1978-01 Issue:1 Volume:25 Page:1-9
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Shiloach Y.¹,Perl Y.²

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