2 papers
cs.CG2026
Towards fast computation of higher discrete homology
Jacob Ender, Chris Kapulkin
We develop a new algorithm for computing the second discrete homology group of a graph which is much faster when compared to existing algorithms. To do so, we identify five basic s…
cs.CG2025
Fast computation of the first discrete homology group
Jacob Ender, Chris Kapulkin
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 significant…