Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye. A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning. In Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, editors, Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual. pages 16885-16898, 2021. [doi]
@inproceedings{LahnRY21,
title = {A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning},
author = {Nathaniel Lahn and Sharath Raghvendra and Jiacheng Ye},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/8ca696ca160520b1cf5a569b4be525e8-Abstract.html},
researchr = {https://researchr.org/publication/LahnRY21},
cites = {0},
citedby = {0},
pages = {16885-16898},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual},
editor = {Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan},
}