Fast computation of the first discrete homology group
Computational Geometry
2025-12-17 v1 Algebraic Topology
Combinatorics
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.
Cite
@article{arxiv.2512.13929,
title = {Fast computation of the first discrete homology group},
author = {Jacob Ender and Chris Kapulkin},
journal= {arXiv preprint arXiv:2512.13929},
year = {2025}
}
Comments
11 pages, including pseudocode; comments welcome