Skip to main content
Conference Proceedings

Minimum cycle bases and their applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5515 LNCS 34-49
DOI: 10.1007/978-3-642-02094-0_2
3Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Berger, F., Gritzmann, P., & De Vries, S. (2009). Minimum cycle bases and their applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5515 LNCS, pp. 34–49). https://doi.org/10.1007/978-3-642-02094-0_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free