Minimum cycle bases and their applications

Franziska Berger; Peter Gritzmann; Sven De Vries

doi:10.1007/978-3-642-02094-0_2

Minimum cycle bases and their applications

Franziska Berger, Peter Gritzmann, Sven De Vries

Chair of Geometry

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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.

Original language	English
Title of host publication	Algorithmics of Large and Complex Networks
Subtitle of host publication	Design, Analysis, and Simulation
Editors	Jurgen Lerner, Dorothea Wagner, Katharina A. Zweig
Pages	34-49
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-02094-0_2
State	Published - 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5515 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/978-3-642-02094-0_2

Cite this

Berger, F., Gritzmann, P., & De Vries, S. (2009). Minimum cycle bases and their applications. In J. Lerner, D. Wagner, & K. A. Zweig (Eds.), Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation (pp. 34-49). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5515 LNCS). https://doi.org/10.1007/978-3-642-02094-0_2

Berger, Franziska ; Gritzmann, Peter ; De Vries, Sven. / Minimum cycle bases and their applications. Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation. editor / Jurgen Lerner ; Dorothea Wagner ; Katharina A. Zweig. 2009. pp. 34-49 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4ae3518ca1384041bfe7cfd5d5cb77d9,

title = "Minimum cycle bases and their applications",

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.",

author = "Franziska Berger and Peter Gritzmann and {De Vries}, Sven",

year = "2009",

doi = "10.1007/978-3-642-02094-0_2",

language = "English",

isbn = "3642020933",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "34--49",

editor = "Jurgen Lerner and Dorothea Wagner and Zweig, {Katharina A.}",

booktitle = "Algorithmics of Large and Complex Networks",

}

Berger, F, Gritzmann, P & De Vries, S 2009, Minimum cycle bases and their applications. in J Lerner, D Wagner & KA Zweig (eds), Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation. 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

Minimum cycle bases and their applications. / Berger, Franziska; Gritzmann, Peter; De Vries, Sven.
Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation. ed. / Jurgen Lerner; Dorothea Wagner; Katharina A. Zweig. 2009. p. 34-49 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5515 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Minimum cycle bases and their applications

AU - Berger, Franziska

AU - Gritzmann, Peter

AU - De Vries, Sven

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70349338913&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02094-0_2

DO - 10.1007/978-3-642-02094-0_2

M3 - Conference contribution

AN - SCOPUS:70349338913

SN - 3642020933

SN - 9783642020933

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 34

EP - 49

BT - Algorithmics of Large and Complex Networks

A2 - Lerner, Jurgen

A2 - Wagner, Dorothea

A2 - Zweig, Katharina A.

ER -

Berger F, Gritzmann P, De Vries S. Minimum cycle bases and their applications. In Lerner J, Wagner D, Zweig KA, editors, Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation. 2009. p. 34-49. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-02094-0_2

Minimum cycle bases and their applications

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this