A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs

Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn. A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener, editors, Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I. Volume 4051 of Lecture Notes in Computer Science, pages 250-261, Springer, 2006. [doi]

Abstract

Abstract is missing.