Minimum cuts and shortest homologous cycles

We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, with two specified vertices s and t, our algorithm computes a minimum (s,t)-cut in gO(g) n log n time. Except for the special case of planar graphs, for which O(n log n)-time algorithms have been known for more than 20 years, the best previous time bounds for finding minimum cuts in embedded graphs follow from algorithms for general sparse graphs. A slight generalization of our minimum-cut algorithm computes a minimum-cost subgraph in every Z2-homology class. We also prove that finding a minimum-cost subgraph homologous to a single input cycle is {NP}-hard.

[1]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

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

[3]  Karsten Weihe.  Maximum (s,t)-flows in planar networks in O(|V|log|V|) time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[4]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[5]  Carsten Thomassen,et al.  Embeddings of graphs with no short noncontractible cycles , 1990, J. Comb. Theory, Ser. B.

[6]  Giovanni Rinaldi,et al.  Easy and difficult objective functions for max cut , 2003, Math. Program..

[7]  Kodama,et al.  Mass Density Laplace-Spectra for Image Recognition , 2007, CW 2007.

[8]  Sergio Cabello,et al.  Many Distances in Planar Graphs , 2006, SODA '06.

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

[10]  Jeff Erickson,et al.  Tightening non-simple paths and cycles on surfaces , 2006, SODA '06.

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

[12]  Jeff Erickson,et al.  Tightening non-simple paths and cycles on surfaces , 2006, SODA 2006.

[13]  G. Borradaile,et al.  Exploiting Planarity for Network Flow and Connectivity Problems , 2008 .

[14]  Francis Lazarus,et al.  Optimal System of Loops on an Orientable Surface , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[15]  Hiroshi Imai,et al.  Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow , 1990, SIGAL International Symposium on Algorithms.

[16]  Afra Zomorodian,et al.  Localized Homology , 2007, IEEE International Conference on Shape Modeling and Applications 2007 (SMI '07).

[17]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[18]  Francis Lazarus,et al.  Optimal System of Loops on an Orientable Surface , 2005, Discret. Comput. Geom..

[19]  Jeff Erickson,et al.  Optimally Cutting a Surface into a Disk , 2002, SCG '02.

[20]  Bojan Mohar,et al.  Finding one tight cycle , 2008, SODA '08.

[21]  Refael Hassin,et al.  An O(n log2 n) Algorithm for Maximum Flow in Undirected Planar Networks , 1985, SIAM J. Comput..

[22]  Glencora Borradaile,et al.  Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs , 2009, STACS.

[23]  G. Ringel.  Map Color Theorem , 1974 .

[24]  Erin W. Chambers,et al.  Splitting (complicated) surfaces is hard , 2006, SCG '06.

[25]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[26]  Gauthier Lafruit,et al.  Adaptive 3D Content for Multi-Platform On-Line Games , 2007, CW 2007.

[28]  J. Stillwell.  Classical topology and combinatorial group theory , 1980 .

[29]  Martin Kutz,et al.  Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time , 2005, SCG '06.

[30]  Giuseppe Liotta.  Graph Algorithms And Applications 2 , 2004 .

[31]  Philip N. Klein,et al.  Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon , 2007, WADS.

[32]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[33]  Václav Koubek,et al.  Minimum cut in directed planar networks , 1992, Kybernetika.

[34]  David Eppstein.  Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

[35]  G. Ringel,et al.  Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[36]  Matthias Müller-Hannemann,et al.  Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation , 2009, Discret. Appl. Math..

[37]  Gary L. Miller,et al.  Flow in Planar Graphs with Multiple Sources and Sinks , 1995, SIAM J. Comput..

[38]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[39]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[40]  Tamal K. Dey,et al.  On Computing Handle and Tunnel Loops , 2007, 2007 International Conference on Cyberworlds (CW'07).

[41]  Jeff Erickson,et al.  Computing the Shortest Essential Cycle , 2010, Discret. Comput. Geom..

[42]  Afra J. Zomorodian,et al.  Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics) , 2005 .

[43]  Martin Mareš.  Two linear time algorithms for MST on minor closed graph classes , 2002 .

[44]  Victor Y. Pan,et al.  Fast and Efficient Parallel Solution of Sparse Linear Systems , 1993, SIAM J. Comput..

[45]  Chao Chen,et al.  Quantifying Homology Classes , 2008, STACS.

[46]  John H. Reif,et al.  Minimum s-t Cut of a Planar Undirected Network in O(n log2(n)) Time , 1983, SIAM J. Comput..

[47]  Piotr Indyk,et al.  Probabilistic embeddings of bounded genus graphs into planar graphs , 2007, SCG '07.

[48]  Bruce A. Reed,et al.  Computing crossing number in linear time , 2007, STOC '07.

[49]  Jonathan L. Gross,et al.  Finding a maximum-genus graph imbedding , 1988, JACM.

[50]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[51]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[52]  Martin Grohe,et al.  Isomorphism testing for embeddable graphs through definability , 2000, STOC '00.

[53]  Zoë J. Wood,et al.  Topological Noise Removal , 2001, Graphics Interface.

[54]  Erik D. Demaine,et al.  Approximation algorithms via contraction decomposition , 2007, SODA '07.

[55]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

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

[57]  Bojan Mohar,et al.  Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs , 2007, Discret. Comput. Geom..

[58]  Erin W. Chambers,et al.  Multiple source shortest paths in a genus g graph , 2007, SODA '07.

[59]  D. Rose,et al.  Generalized nested dissection , 1977 .

[60]  A. Schrijver.  On the History of Combinatorial Optimization (Till 1960) , 2005 .

[61]  David Cohen-Steiner,et al.  Computing geometry-aware handle and tunnel loops in 3D models , 2008, ACM Trans. Graph..

[62]  Gary L. Miller,et al.  Isomorphism testing for graphs of bounded genus , 1980, STOC '80.

[63]  Philip N. Klein,et al.  A polynomial-time approximation scheme for Steiner tree in planar graphs , 2007, SODA '07.

[64]  Alon Itai,et al.  Maximum Flow in Planar Networks , 1979, SIAM J. Comput..

[65]  Philip N. Klein,et al.  Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm , 2010, TALG.

[66]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1998, JACM.

[67]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[68]  T. E. Harris,et al.  Fundamentals of a Method for Evaluating Rail Net Capacities , 1955 .

[69]  Francis Lazarus,et al.  Optimal pants decompositions and shortest homotopic cycles on an orientable surface , 2003, JACM.

[70]  Karsten Weihe,et al.  Maximum s-t-flow with k crossings in O(k3n log n) time , 2007, SODA '07.

[71]  O. Borůvka.  On Minimum Spanning Trees , 1998 .

[72]  Chao Chen,et al.  Quantifying Homology Classes II: Localization and Stability , 2007, ArXiv.

[73]  K. Weihe.  Maximum (s,t)-Flows in Planar Networks in O( , 1997 .

[74]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[75]  Samuel I. Daitch,et al.  Faster Lossy Generalized Flow via Interior Point Algorithms , 2008 .

[76]  Jeff Erickson,et al.  Greedy optimal homotopy and homology generators , 2005, SODA '05.

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

[78]  Eric Colin de Verdière.  Raccourcissement de courbes et décomposition de surfaces , 2003 .

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