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.
Seitenangaben Beitrag:
1894-1909
Herausgeber:
Jürgen Lerner, Dorothea Wagner, Katharina A. Zweig
Buchtitel:
Algorithmics of Large and Complex Networks
Verlag / Institution:
Springer
Jahr:
2009
Print-ISBN:
978-3-642-02093-3
E-ISBN:
978-3-642-02094-0
Serientitel:
Lecture Notes in Computer Science
Reviewed:
ja
Sprache:
en
TUM Einrichtung:
Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik