Abstract
In a network with capacitated arcs, the maximum capacity path problem is to find the bottleneck path between two nodes that has the maximum capacity among all the paths between the nodes. In this work, a problem of identification of such a path is considered allowing arc reversals in a directed graph where the capacity of the reversed arc can be added to the capacity of its counterpart. We propose an O(m) algorithm to solve the problem in a directed graph with arcs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
