Minimum cycle bases of weighted undirected and directed graphs are bases of the cycle space of the (di)graphs with minimum weight. We survey the known polynomial-time algorithms for their construction, explain some of their properties and describe a few important applications.
Editor:
Jürgen Lerner, Dorothea Wagner, Katharina A. Zweig
Book title:
Algorithmics of Large and Complex Networks
Publisher:
Springer
Year:
2009
Print-ISBN:
978-3-642-02093-3
E-ISBN:
978-3-642-02094-0
Bookseries title:
Lecture Notes in Computer Science
Reviewed:
ja
Language:
en
TUM Institution:
Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik