مشخصات پژوهش

عنوان	An O ( | E | ) time algorithm to find a bottleneck link in single rate two-pair networks
نوع پژوهش	مقاله چاپ‌شده در مجلات علمی
کلیدواژه‌ها	Network coding; Single rate two-pair networks; Bottleneck links; Region graph.
چکیده	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.
پژوهشگران	مهدی قیاسوند (نفر اول)، سپیده قزوینه (نفر دوم)