All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs

For an undirected $n$-vertex graph $G$ with non-negative edge-weights, we consider the following type of query: given two vertices $s$ and $t$ in $G$, what is the weight of a minimum $st$-cut in $G$? We solve this problem in preprocessing time $O(n\log^3 n)$ for graphs of bounded genus, giving the first sub-quadratic time algorithm for this class of graphs. Our result also improves by a logarithmic factor a previous algorithm by Borradaile, Sankowski and Wulff-Nilsen (FOCS 2010) that applied only to planar graphs. Our algorithm constructs a Gomory-Hu tree for the given graph, providing a data structure with space $O(n)$ that can answer minimum-cut queries in constant time. The dependence on the genus of the input graph in our preprocessing time is $2^{O(g^2)}$.

[1]  Sergio Cabello,et al.  Finding shortest non-trivial cycles in directed graphs on surfaces , 2016, J. Comput. Geom..

[2]  Kyle Fox,et al.  Global Minimum Cuts in Surface-Embedded Graphs , 2012, Encyclopedia of Algorithms.

[3]  Piotr Sankowski,et al.  Single Source -- All Sinks Max Flows in Planar Digraphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[4]  H. Whitney.  Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.

[5]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[6]  Gad M. Landau,et al.  On Cartesian Trees and Range Minimum Queries , 2009, ICALP.

[7]  Jeff Erickson,et al.  A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs , 2014, Symposium on Computational Geometry.

[8]  Jeff Erickson.  Shortest non-trivial cycles in directed surface graphs , 2011, SoCG '11.

[9]  Erin W. Chambers,et al.  Minimum cuts and shortest homologous cycles , 2009, SCG '09.

[10]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[11]  Glencora Borradaile,et al.  Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[12]  Philip N. Klein,et al.  Multiple-source shortest paths in planar graphs , 2005, SODA '05.

[13]  Amir Nayyeri,et al.  Minimum cuts and shortest non-separating cycles via homology covers , 2011, SODA '11.

[14]  Erin W. Chambers,et al.  Homology flows, cohomology cuts , 2009, STOC '09.

[15]  R. Ho.  Algebraic Topology , 2022 .

[16]  Satish Rao,et al.  Planar graphs, negative weight edges, shortest paths, and near linear time , 2006, J. Comput. Syst. Sci..

[17]  Philip N. Klein,et al.  Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time , 2011, FOCS.

[18]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[19]  Gary L. Miller,et al.  Finding small simple cycle separators for 2-connected planar graphs. , 1984, STOC '84.

[20]  Sergio Cabello,et al.  Finding shortest non-trivial cycles in directed graphs on surfaces , 2010, J. Comput. Geom..

[21]  David Hartvigsen,et al.  The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs , 1994, SIAM J. Discret. Math..

[22]  Dan Gusfield,et al.  Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..