The following publications are possibly variants of this publication:
- An Õ(::::m:::::::2:::::::n::::) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed GraphTelikepalli Kavitha. icalp 2005: 273-284 [doi]
- Breaking the O(m:::2:::n) Barrier for Minimum Cycle BasesEdoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi. esa 2009: 301-312 [doi]
- Algorithms to Compute Minimum Cycle Basis in Directed GraphsTelikepalli Kavitha, Kurt Mehlhorn. mst, 40(4):485-505, 2007. [doi]
- Faster Algorithms for Minimum Cycle Basis in Directed GraphsRamesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn. SICOMP, 38(4):1430-1447, 2008. [doi]
- A Faster Algorithm for Minimum Cycle Basis of GraphsTelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. icalp 2004: 846-857 [doi]
- A Polynomial Time Algorithm for Minimum Cycle Basis in Directed GraphsTelikepalli Kavitha, Kurt Mehlhorn. STACS 2005: 654-665 [doi]
- Implementing minimum cycle basis algorithmsKurt Mehlhorn, Dimitrios Michail. jea, 11, 2006. [doi]
- Implementing Minimum Cycle Basis AlgorithmsKurt Mehlhorn, Dimitrios Michail. wea 2005: 32-43 [doi]