Efficient approximation algorithms for shortest cycles in undirected graphs

Andrzej Lingas, Eva-Marta Lundell. Efficient approximation algorithms for shortest cycles in undirected graphs. Inf. Process. Lett., 109(10):493-498, 2009. [doi]

@article{LingasL09,
  title = {Efficient approximation algorithms for shortest cycles in undirected graphs},
  author = {Andrzej Lingas and Eva-Marta Lundell},
  year = {2009},
  doi = {10.1016/j.ipl.2009.01.008},
  url = {http://dx.doi.org/10.1016/j.ipl.2009.01.008},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LingasL09},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {109},
  number = {10},
  pages = {493-498},
}