Breaking the O(m 2 n) Barrier for Minimum Cycle Bases

Abstract

We give improved algorithms for constructing minimum directed and undirected cycle bases in graphs. For general graphs, the new algorithms are Monte Carlo and have running time O(m ω), where ω is the exponent of matrix multiplication. The previous best algorithm had running time \({\tilde{O}}(m^2n)\). For planar graphs, the new algorithm is deterministic and has running time O(n 2). The previous best algorithm had running time O(n 2 logn). A key ingredient to our improved running times is the insight that the search for minimum bases can be restricted to a set of candidate cycles of total length O(nm).KeywordsPlanar GraphMonte Carlo AlgorithmDirected CycleCycle BasisMinimum CycleThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.