Fast computation of the first discrete homology group
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912767482527744 |
|---|---|
| author | Ender, Jacob Kapulkin, Chris |
| author_facet | Ender, Jacob Kapulkin, Chris |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_13929 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fast computation of the first discrete homology group Ender, Jacob Kapulkin, Chris Computational Geometry Algebraic Topology Combinatorics 05-04 (primary), 05C25, 55U15 (secondary) 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. |
| title | Fast computation of the first discrete homology group |
| topic | Computational Geometry Algebraic Topology Combinatorics 05-04 (primary), 05C25, 55U15 (secondary) |
| url | https://arxiv.org/abs/2512.13929 |