Fast computation of the first discrete homology group
Authors
Jacob Ender, Chris Kapulkin
Abstract
We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.
