Fully Dynamic Maximal Matching in O (log n) Update Time

Surender Baswana, Manoj Gupta, Sandeep Sen. Fully Dynamic Maximal Matching in O (log n) Update Time. In Rafail Ostrovsky, editor, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011. pages 383-392, IEEE, 2011. [doi]

@inproceedings{BaswanaGS11,
  title = {Fully Dynamic Maximal Matching in O (log n) Update Time},
  author = {Surender Baswana and Manoj Gupta and Sandeep Sen},
  year = {2011},
  doi = {10.1109/FOCS.2011.89},
  url = {http://dx.doi.org/10.1109/FOCS.2011.89},
  researchr = {https://researchr.org/publication/BaswanaGS11},
  cites = {0},
  citedby = {0},
  pages = {383-392},
  booktitle = {IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011},
  editor = {Rafail Ostrovsky},
  publisher = {IEEE},
  isbn = {978-1-4577-1843-4},
}