Ola Svensson, Jakub Tarnawski. The Matching Problem in General Graphs Is in Quasi-NC. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. pages 696-707, IEEE Computer Society, 2017. [doi]
@inproceedings{SvenssonT17-0, title = {The Matching Problem in General Graphs Is in Quasi-NC}, author = {Ola Svensson and Jakub Tarnawski}, year = {2017}, doi = {10.1109/FOCS.2017.70}, url = {https://doi.org/10.1109/FOCS.2017.70}, researchr = {https://researchr.org/publication/SvenssonT17-0}, cites = {0}, citedby = {0}, pages = {696-707}, booktitle = {58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017}, editor = {Chris Umans}, publisher = {IEEE Computer Society}, isbn = {978-1-5386-3464-6}, }