Planar Maximum Matching: Towards a Parallel Algorithm

Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee 0001. Planar Maximum Matching: Towards a Parallel Algorithm. In Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao, editors, 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan. Volume 123 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

@inproceedings{DattaKK018,
  title = {Planar Maximum Matching: Towards a Parallel Algorithm},
  author = {Samir Datta and Raghav Kulkarni and Ashish Kumar and Anish Mukherjee 0001},
  year = {2018},
  doi = {10.4230/LIPIcs.ISAAC.2018.21},
  url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.21},
  researchr = {https://researchr.org/publication/DattaKK018},
  cites = {0},
  citedby = {0},
  booktitle = {29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
  editor = {Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao},
  volume = {123},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-094-1},
}