Algorithms to Compute Minimum Cycle Basis in Directed Graphs

Telikepalli Kavitha, Kurt Mehlhorn. Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Theory Comput. Syst., 40(4):485-505, 2007. [doi]

@article{KavithaM07,
  title = {Algorithms to Compute Minimum Cycle Basis in Directed Graphs},
  author = {Telikepalli Kavitha and Kurt Mehlhorn},
  year = {2007},
  doi = {10.1007/s00224-006-1319-6},
  url = {http://dx.doi.org/10.1007/s00224-006-1319-6},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KavithaM07},
  cites = {0},
  citedby = {0},
  journal = {Theory Comput. Syst.},
  volume = {40},
  number = {4},
  pages = {485-505},
}