An Efficient Algorithm for All-Pairs Bounded Edge Connectivity

Our work concerns algorithms for a variant of Maximum Flow in unweighted graphs. In the All-Pairs Connectivity (APC) problem, we are given a graph G on n vertices and m edges, and are tasked with computing the maximum number of edge-disjoint paths from s to t (equivalently, the size of a minimum (s,...

詳細記述

書誌詳細
主要な著者: Akmal, Shyan, Jin, Ce
その他の著者: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
フォーマット: 論文
言語:English
出版事項: Springer US 2024
オンライン・アクセス:https://hdl.handle.net/1721.1/153416