We give the first known 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(ℂ) for a minimum cycle basis ℂ of G. Each cycle in ℂ can be computed from Z(ℂ) in O(1) time per edge. Our result works for directed and undirected outerplanar graphs G. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Liu, T. H., & Lu, H. I. (2009). Minimum cycle bases of weighted outerplanar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 564–572). https://doi.org/10.1007/978-3-642-10631-6_58
Mendeley helps you to discover research relevant for your work.