Telikepalli Kavitha
An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
ICALP, 2005.
@inproceedings{ICALP-2005-Kavitha, author = "Telikepalli Kavitha", booktitle = "{Proceedings of the 32nd International Colloquium on Automata, Languages and Programming}", doi = "10.1007/11523468_23", isbn = "3-540-27580-0", pages = "273--284", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph}", volume = 3580, year = 2005, }