According to the software Hera, bottleneck distance is computed by finding an perfect matching with minimal cost using the Hopcroft-Karp algorithm.

furthermore, the wasserstein distance between persistence diagrams is computed by the auction algorithm.

Why do we need two separate algorithms to compute the perfect matching needed for both bottleneck and wasserstein distances?

What is the difference between the computation of wasserstein distance and bottle neck distance?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.