A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid

Alexander Golynski, Joseph Douglas Horton. A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid. In Martti Penttonen, Erik Meineche Schmidt, editors, Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings. Volume 2368 of Lecture Notes in Computer Science, pages 200-209, Springer, 2002. [doi]

@inproceedings{GolynskiH02,
  title = {A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid},
  author = {Alexander Golynski and Joseph Douglas Horton},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2368/23680200.htm},
  researchr = {https://researchr.org/publication/GolynskiH02},
  cites = {0},
  citedby = {0},
  pages = {200-209},
  booktitle = {Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings},
  editor = {Martti Penttonen and Erik Meineche Schmidt},
  volume = {2368},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-43866-1},
}