Abstract
We present a row reduction algorithm to compute the barcode decomposition of persistence modules. This algorithm dualises the standard persistence one and clarifies the symmetry between clear and compress optimisations.
| Original language | English |
|---|---|
| Title of host publication | Book of Abstracts: 37th European Workshop on Computational Geometry |
| Pages | 11:1-11:6 |
| Publication status | Published - Jan 2021 |
| Event | 37th European Workshop on Computational Geometry - Virtual - St Petersburg, Russia Duration: 7 Apr 2021 → 9 Apr 2021 |
Conference
| Conference | 37th European Workshop on Computational Geometry |
|---|---|
| Abbreviated title | EuroCG 2021 |
| Period | 7/04/21 → 9/04/21 |