Abstract
Maximum adjacency (MA) ordering has effectively been applied to graph connectivity problems by Nagamochi and Ibaraki. We show an application of MA ordering to the maximum flow problem to get a new polynomial-time algorithm and propose its scaling versions that run in O (mnlogt7) time, where TO is the number of arcs, n the number of vertices, and U the maximum capacity. We give computational results, comparing our algorithms with those of Goldberg-Tarjan and Dinitz, to show behaviors of our proposed algorithms.
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 callMore From: Journal of the Operations Research Society of Japan
Disclaimer: 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.
