Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings

Marek Cygan, Harold N. Gabow, Piotr Sankowski. Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012. pages 531-540, IEEE Computer Society, 2012. [doi]

@inproceedings{CyganGS12,
  title = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings},
  author = {Marek Cygan and Harold N. Gabow and Piotr Sankowski},
  year = {2012},
  doi = {10.1109/FOCS.2012.72},
  url = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2012.72},
  researchr = {https://researchr.org/publication/CyganGS12},
  cites = {0},
  citedby = {0},
  pages = {531-540},
  booktitle = {53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4673-4383-1},
}