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.
