Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching

Hongteng Xu, Dixin Luo, Lawrence Carin. Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching. In Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Edward A. Fox, Roman Garnett, editors, Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8-14 December 2019, Vancouver, BC, Canada. pages 3046-3056, 2019. [doi]

@inproceedings{XuLC19-3,
  title = {Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching},
  author = {Hongteng Xu and Dixin Luo and Lawrence Carin},
  year = {2019},
  url = {http://papers.nips.cc/paper/8569-scalable-gromov-wasserstein-learning-for-graph-partitioning-and-matching},
  researchr = {https://researchr.org/publication/XuLC19-3},
  cites = {0},
  citedby = {0},
  pages = {3046-3056},
  booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8-14 December 2019, Vancouver, BC, Canada},
  editor = {Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alché-Buc and Edward A. Fox and Roman Garnett},
}