Cycle bases in graphs characterization, algorithms, complexity, and applications

Kavitha, T., Liebchen, C., Mehlhorn, K., Michail, D., Rizzi, R., Ueckerdt, T., & Zweig, K. A. (2009). Cycle bases in graphs characterization, algorithms, complexity, and applications. Computer Science Review, 3(4), 199–243. https://doi.org/10.1016/j.cosrev.2009.08.001

Kavitha, Telikepalli, et al. “Cycle bases in graphs characterization, algorithms, complexity, and applications.” Computer Science Review, vol. 3, no. 4, 2009, pp. 199–243, https://doi.org/10.1016/j.cosrev.2009.08.001.

Kavitha, Telikepalli, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Roméo Rizzi, Torsten Ueckerdt, and Katharina A. Zweig. 2009. “Cycle bases in graphs characterization, algorithms, complexity, and applications.” Computer Science Review 3 (4): 199–243. https://doi.org/10.1016/j.cosrev.2009.08.001.

Kavitha, T. et al. (2009) ‘Cycle bases in graphs characterization, algorithms, complexity, and applications’, Computer Science Review, 3(4), pp. 199–243. Available at: https://doi.org/10.1016/j.cosrev.2009.08.001.

@article{kavitha2009cycle,
  title = {{Cycle bases in graphs characterization, algorithms, complexity, and applications}},
  author = {Kavitha, Telikepalli and Liebchen, Christian and Mehlhorn, Kurt and Michail, Dimitrios and Rizzi, Roméo and Ueckerdt, Torsten and Zweig, Katharina A.},
  journal = {Computer Science Review},
  volume = {3},
  number = {4},
  pages = {199--243},
  year = {2009},
  doi = {10.1016/j.cosrev.2009.08.001}
}