Next Article in Journal
Weak n-Ary Relational Products in Allegories
Next Article in Special Issue
A Simplified Algorithm for Inverting Higher Order Diffusion Tensors
Previous Article in Journal
Space-Time Fractional Reaction-Diffusion Equations Associated with a Generalized Riemann–Liouville Fractional Derivative
Previous Article in Special Issue
Matching the LBO Eigenspace of Non-Rigid Shapes via High Order Statistics
Article Menu

Export Article

Open AccessArticle
Axioms 2014, 3(3), 335-341; https://doi.org/10.3390/axioms3030335

The Gromov–Wasserstein Distance: A Brief Overview

Department of Mathematics, The Ohio State University, Columbus, OH, USA
Received: 1 May 2014 / Revised: 12 August 2014 / Accepted: 22 August 2014 / Published: 2 September 2014
Full-Text   |   PDF [213 KB, uploaded 2 September 2014]

Abstract

We recall the construction of the Gromov–Wasserstein distance and concentrate on quantitative aspects of the definition. View Full-Text
Keywords: metric geometry; graph theory; shape recognition; optimal transportation metric geometry; graph theory; shape recognition; optimal transportation
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Mémoli, F. The Gromov–Wasserstein Distance: A Brief Overview. Axioms 2014, 3, 335-341.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Axioms EISSN 2075-1680 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top