Abstract
We present a linear time algorithm for computing an implicit linear space representation of a minimum cycle basis (MCB) in weighted partial 2-trees, i.e., graphs of treewidth two. The implicit representation can be made explicit in a running time that is proportional to the size of the MCB.
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 MCB 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].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amaldi, E., Iuliano, C., Jurkiewicz, T., Mehlhorn, K., Rizzi, R.: Breaking the o(m 2 n) barrier for minimum cycle bases. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 301–312. Springer, Heidelberg (2009)
Amaldi, E., Iuliano, C., Rizzi, R.: Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 397–410. Springer, Heidelberg (2010)
Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal of Computing 25(6), 1305–1317 (1996)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209(1-2), 1–45 (1998)
Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer (2008)
Borradaile, G., Sankowski, P., Wulff-Nilsen, C.: Min st-cut oracle for planar graphs with near-linear preprocessing time. In: Proc. of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 601–610. IEEE Computer Society (2010)
Chaudhuri, S., Zaroliagis, C.D.: Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica 27(3), 212–226 (2000)
Diestel, R.: Graph Theory, 4th edn. Springer (2010)
Frederickson, G.N., Janardan, R.: Designing networks with compact routing tables. Algorithmica 3, 171–190 (1988)
Hartvigsen, D., Mardon, R.: The all-pairs min cut problem and the minimum cycle basis problem on planar graphs. SIAM Journal on Discrete Mathematics 7, 403–418 (1994)
Horton, J.D.: A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM Journal of Computing 16, 358–366 (1987)
Kavitha, T., Liebchen, C., Mehlhorn, K., Michail, D., Rizzi, R., Ueckerdt, T., Zweig, K.A.: Cycle bases in graphs characterization, algorithms, complexity, and applications. Computer Science Review 3(4), 199–243 (2009)
Leydold, J., Stadler, P.F.: Minimal cycle bases of outerplanar graphs. Electronic Journal of Combinatorics 5 (1998)
Liu, T., Lu, H.: Minimum cycle bases of weighted outerplanar graphs. Information Processing Letters 110, 970–974 (2010); A preliminary report appeared in Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 564–572. Springer, Heidelberg (2009)
Narayanaswamy, N.S., Ramakrishna, G.: Characterization of minimum cycle bases in weighted partial 2-trees. In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), pp. 193–196 (2012), http://arxiv.org/abs/1302.5889 All references in this paper refer to this arXiv version
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doerr, C., Ramakrishna, G., Schmidt, J.M. (2013). Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. In: Brandstädt, A., Jansen, K., Reischuk, R. (eds) Graph-Theoretic Concepts in Computer Science. WG 2013. Lecture Notes in Computer Science, vol 8165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45043-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-45043-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45042-6
Online ISBN: 978-3-642-45043-3
eBook Packages: Computer ScienceComputer Science (R0)