Maximum Matchings in Planar Graphs via Gaussian Elimination

Marcin Mucha, Piotr Sankowski. Maximum Matchings in Planar Graphs via Gaussian Elimination. Algorithmica, 45(1):3-20, 2006. [doi]

@article{MuchaS06,
  title = {Maximum Matchings in Planar Graphs via Gaussian Elimination},
  author = {Marcin Mucha and Piotr Sankowski},
  year = {2006},
  doi = {10.1007/s00453-005-1187-5},
  url = {http://dx.doi.org/10.1007/s00453-005-1187-5},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/MuchaS06},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {45},
  number = {1},
  pages = {3-20},
}