summaryrefslogtreecommitdiff
path: root/README.txt
diff options
context:
space:
mode:
Diffstat (limited to 'README.txt')
-rw-r--r--README.txt15
1 files changed, 11 insertions, 4 deletions
diff --git a/README.txt b/README.txt
index ae3f6a0..48a77c0 100644
--- a/README.txt
+++ b/README.txt
@@ -1,5 +1,6 @@
This repository contains software to compute bottleneck and Wasserstein
-distances between persistence diagrams.
+distances between persistence diagrams, and matching distance
+between 2-parameter persistence modules and (1-critical) bi-filtrations.
The software is licensed under
BSD license, see license.txt file.
@@ -9,13 +10,14 @@ you probably do not need to worry about that.
See README files in subdirectories for usage and building.
If you use Hera in your project, we would appreciate if you
-cite the corresponding paper:
+cite the corresponding paper.
+
+Bottleneck or Wasserstein distance:
+
Michael Kerber, Dmitriy Morozov, and Arnur Nigmetov,
"Geometry Helps to Compare Persistence Diagrams.",
Journal of Experimental Algorithmics, vol. 22, 2017, pp. 1--20.
(conference version: ALENEX 2016).
-The BibTeX is below:
-
@article{jea_hera,
title={Geometry helps to compare persistence diagrams},
@@ -26,3 +28,8 @@ The BibTeX is below:
year={2017},
publisher={ACM New York, NY, USA}
}
+
+Matching distance:
+
+Michael Kerber, Arnur Nigmetov, "Efficient Approximation of the Matching
+Distance for 2-parameter persistence.", SoCG 2020