Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification
Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification
Previous chapter Next chapter Full AccessProceedings 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph SparsificationTamal K. Dey and Simon ZhangTamal K. Dey and Simon Zhangpp.169 - 183Chapter DOI:https://doi.org/10.1137/1.9781611977042.14PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract Persistence diagrams (PD)s play a central …