Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time - Archive ouverte HAL Access content directly
Journal Articles Journal of Graph Algorithms and Applications Year : 2014

Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time

Abstract

We present a linear time algorithm for computing an implicit linear space representation of a minimum cycle basis in weighted partial 2-trees (i.e., graphs of treewidth at most two) with non-negative edge-weights. The implicit representation can be made explicit in a running time that is proportional to the size of the minimum cycle basis. For planar graphs, Borradaile, Sankowski, and Wulff-Nilsen [Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, FOCS 2010] showed how to compute an implicit O(n logn) space representation of an minimum cycle basis in O(n log5 n) time. For the special case of partial 2-trees, our algorithm improves this result to linear time and space. Such an improvement was achieved previously only for outerplanar graphs [Liu and Lu: Minimum Cycle Bases of Weighted Outerplanar Graphs, IPL 110:970-974, 2010]

Dates and versions

hal-01086511 , version 1 (24-11-2014)

Identifiers

Cite

Carola Doerr, Jens M. Schmidt, G. Ramakrishna. Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. Journal of Graph Algorithms and Applications, 2014, 18, pp.325-346. ⟨10.7155/jgaa.00325⟩. ⟨hal-01086511⟩
100 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More