(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs. Barak, B., Chou, C., Lei, Z., Schramm, T., & Sheng, Y. In Wallach, H. M., Larochelle, H., Beygelzimer, A., d'Alché-Buc , F., Fox, E. B., & Garnett, R., editors, Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, pages 9186–9194, 2019.
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs [link]Paper  bibtex   28 downloads  
@inproceedings{DBLP:conf/nips/BarakCLSS19,
  author       = {Boaz Barak and
                  Chi{-}Ning Chou and
                  Zhixian Lei and
                  Tselil Schramm and
                  Yueqi Sheng},
  editor       = {Hanna M. Wallach and
                  Hugo Larochelle and
                  Alina Beygelzimer and
                  Florence d'Alch{\'{e}}{-}Buc and
                  Emily B. Fox and
                  Roman Garnett},
  title        = {(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated
                  Random Graphs},
  booktitle    = {Advances in Neural Information Processing Systems 32: Annual Conference
                  on Neural Information Processing Systems 2019, NeurIPS 2019, December
                  8-14, 2019, Vancouver, BC, Canada},
  pages        = {9186--9194},
  year         = {2019},
  url          = {https://proceedings.neurips.cc/paper/2019/hash/aba22f748b1a6dff75bda4fd1ee9fe07-Abstract.html},
  timestamp    = {Thu, 21 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/nips/BarakCLSS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 28