Abstract
Motivated by applications in parallel and dynamic graph algorithms, we investigate the tradeoff between width and diameter of tree decompositions. For all integers n, k and K with 1 ≤ k ≤ K ≤ n− 1, denote by D(n, k, K) the maximum, over all n-vertex graphs G of treewidth k, of the smallest diameter of a tree decomposition of G of width K. We determine D(n, k, K), up to a constant factor, for all values of n, k and K. When K is bounded by a constant (the case of greatest practical relevance), D(n, k, K) is θ(n) for K ≤ 2k-1, θ(√n) for 2k ≤ K ≤ 3k−2, and θ(log n) for K ≥ 3k−1. We provide much more accurate bounds for the case K ≤ 2k−1.
This research was partially supported by ESPRIT Long Term Research Project 20244 (project ALCOM-IT: Algorithms and Complexity in Information Technology). The work was carried out while the first author was with the Max-Planck-Institut für Informatik in Saarbrücken, Germany.
Preview
Unable to display preview. Download preview PDF.
References
H. L. Bodlaender, NC-algorithms for graphs with small treewidth, in Proc. 14th International Workshop on Graph-Theoretic Concepts in Computer Science, J. van Leeuwen, ed., Lecture Notes in Computer Science, Springer-Verlag, Berlin, vol. 344, 1989, pp. 1–10.
H. L. Bodlaender, Treewidth: Algorithmic techniques and results, in Proc. 22nd International Symposium on Mathematical Foundations of Computer Science, I. Prívara and P. RuŽička, eds., Lecture Notes in Computer Science, Springer-Verlag, Berlin, vol. 1295, 1997, pp. 19–36.
H. L. Bodlaender and T. Hagerup, Parallel algorithms with optimal speedup for bounded treewidth, in Proc. 22nd International Colloquium on Automata, Languages and Programming, Z. Fülöp and F. Gécseg, eds., Lecture Notes in Computer Science, Springer-Verlag, Berlin, vol. 944, 1995, pp. 268–279. To appear in SIAM J. Computing, 1998.
N. Chandrasekharan, Fast Parallel Algorithms and Enumeration Techniques for Partial k-Trees, Ph.D. thesis, Clemson University, 1989.
N. Chandrasekharan and S. T. Hedetniemi, Fast parallel algorithms for tree decomposing and parsing partial k-trees, in Proc. 26th Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, Illinois, 1988, pp. 283–292.
S. Chaudhuri and C.D. Zaroliagis, Optimal parallel shortest paths in small treewidth digraphs, in Proc. 3rd Annual European Symposium on Algorithms, P. Spirakis, ed., Lecture Notes in Computer Science, Springer-Verlag, Berlin, vol. 979, 1995, pp. 31–45. To appear in Theoretical Computer Science, 1998.
T. Hagerup, Dynamic algorithms for graphs of bounded treewidth, in Proc. 24th International Colloquium on Automata, Languages and Programming, P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, eds., Lecture Notes in Computer Science, Springer-Verlag, Berlin, vol. 1256, 1997, pp. 292–302.
T. Hagerup, J. Katajainen, N. Nishimura, and P. Ragde, Characterizations of k-terminal flow networks and computing network flows in partial k-trees, in Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 641–649.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodlaender, H.L., Hagerup, T. (1998). Tree decompositions of small diameter. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055821
Download citation
DOI: https://doi.org/10.1007/BFb0055821
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64827-7
Online ISBN: 978-3-540-68532-6
eBook Packages: Springer Book Archive