Minimum Cycle Bases and Their Applications

Authors:
Franziska Berger;Peter Gritzmann;Sven Vries
Affiliations:
Department of Mathematics, Polytechnic Institute of NYU, Six MetroTech Center, Brooklyn, USA 11201;Zentrum Mathematik, Technische Universität München, München, Germany 80290;FB IV, Mathematik, Universität Trier, Trier, Germany 54286
Venue:
Algorithmics of Large and Complex Networks
Year:
2009

Citing 17
Cited 0

A polynomial-time algorithm to find the shortest cycle basis of a graph

SIAM Journal on Computing
A mathematical for periodic scheduling problems

SIAM Journal on Discrete Mathematics
Active network analysis

Active network analysis
The prism-free planar graphs and their cycles bases

Journal of Graph Theory
When do short cycles generate the cycle space?

Journal of Combinatorial Theory Series B
Periodic network optimization with different arc frequencies

Discrete Applied Mathematics
Algorithms for Generating Fundamental Cycles in a Graph

ACM Transactions on Mathematical Software (TOMS)
An algorithm for finding a fundamental set of cycles of a graph

Communications of the ACM
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Minimum Cycle Bases for Network Graphs

Algorithmica
Classes of cycle bases

Discrete Applied Mathematics
Algorithms to Compute Minimum Cycle Basis in Directed Graphs

Theory of Computing Systems
Minimum Weakly Fundamental Cycle Bases Are Hard To Find

Algorithmica
Minimum cycle bases: Faster and simpler

ACM Transactions on Algorithms (TALG)
Faster Algorithms for Minimum Cycle Basis in Directed Graphs

SIAM Journal on Computing
A greedy approach to compute a minimum cycle basis of a directed graph

Information Processing Letters
New approximation algorithms for minimum cycle bases of graphs

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

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.