Minimum cycle bases of weighted outerplanar graphs

Authors:
Tsung-Hao Liu;Hsueh-I Lu
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taiwan
Venue:
Information Processing Letters
Year:
2010

Citing 14
Cited 0

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

SIAM Journal on Computing
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs

SIAM Journal on Discrete Mathematics
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
Implementing minimum cycle basis algorithms

Journal of Experimental Algorithmics (JEA)
Classes of cycle bases

Discrete Applied Mathematics
Minimum cycle bases of direct products of complete graphs

Information Processing Letters
Minimum cycle bases of Halin graphs

Journal of Graph Theory
An $\tilde{O}(m^{2}n)$Algorithm for Minimum Cycle Basis of Graphs

Algorithmica
Minimum cycle bases: Faster and simpler

ACM Transactions on Algorithms (TALG)
Minimum Cycle Bases of Weighted Outerplanar Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
New approximation algorithms for minimum cycle bases of graphs

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Minimum cycle bases in graphs algorithms and applications

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give the first optimal algorithm that computes a minimum cycle basis for any weighted outerplanar graph. Specifically, for any n-node edge-weighted outerplanar graph G, we give an O(n)-time algorithm to obtain an O(n)-space compact representation Z(C) for a minimum cycle basis C of G. Each cycle in C can be computed from Z(C) in O(1) time per edge. Our result works for directed and undirected outerplanar graphs G.