Abstract
This paper presents a new algorithm to find a bottleneck link in single rate two-pair networks using the region decomposition method. The algorithm runs in O(|E|) time, which improves upon the previous polynomial time of O(|V||E|3) due to Cai and Fan (2006), where |E| and |V| denote the number of edges and nodes, respectively.
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.
