GOT: An Optimal Transport framework for Graph comparison

Neural Information Processing Systems 

This allows us to derive an explicit expression of the Wasserstein distance between graph signal distributions in terms of the graph Laplacian matrices.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found