Approximating 1-Wasserstein distance between persistence diagrams by graph sparsification (Q6543142)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating 1-Wasserstein distance between persistence diagrams by graph sparsification |
scientific article; zbMATH DE number 7852737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating 1-Wasserstein distance between persistence diagrams by graph sparsification |
scientific article; zbMATH DE number 7852737 |
Statements
Approximating 1-Wasserstein distance between persistence diagrams by graph sparsification (English)
0 references
24 May 2024
0 references
0.7745710015296936
0 references
0.7739591002464294
0 references
0.7463962435722351
0 references
0.7231594324111938
0 references
0.7172538638114929
0 references
