论文标题
边缘连接在接近线性的时间内
Edge Connectivity Augmentation in Near-Linear Time
论文作者
论文摘要
我们给出了$ \ tilde {o}（m）$ - 边缘连接问题和密切相关的边缘分割问题的时间算法。这是最佳的较低订单条款，并关闭了这些问题的长期工作。
We give an $\tilde{O}(m)$-time algorithm for the edge connectivity augmentation problem and the closely related edge splitting-off problem. This is optimal up to lower order terms and closes the long line of work on these problems.
