Abstract
The goal of this chapter is to provide insights into treewidth obtained from experiments. In our experiments, we count the numbers of combinatorial objects closely related to treewidth in random graph instances. These combinatorial objects include connected sets, minimal separators, potential maximal cliques, and those with certain constraints. Such experimental analysis is expected to complement theoretical analysis, reveal the reasons why some algorithms work well in practice while some do not, and provide a basis for designing new algorithms.
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
References
Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8, 277–284 (1987)
Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: On exact algorithms for treewidth. ACM Trans. Algorithms 9(1), 12 (2012)
Bouchitté, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212–232 (2001)
Bouchitté, V., Todinca, I.: Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276, 17–32 (2002)
Dell, H., Husfeldt, T., Jansen, B.M., Kaski, P., Komusiewicz, C., Rosamond, F.A.: The first parameterized algorithms and computational experiments challenge. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 63 (2017)
Dell, H., Komusiewicz, C., Talmon, N., Weller, M.: The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration. In: Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), pp. 30:1–30:12 (2018)
Fomin, F., Villanger, Y.: Treewidth computation and extremal combinatorics. Combinatorica 32(3), 289–308 (2012)
Tamaki, H.: Positive-instance driven dynamic programming for treewidth. J. Comb. Optim. 37(4), 1283–1311 (2019). (First Online October 2018)
Tamaki, H.: Computing treewidth via exact and heuristic lists of minimal separators. In: Kotsireas, I., Pardalos, P., Parsopoulos, K.E., Souravlias, D., Tsokas, A. (eds.) SEA 2019. LNCS, vol. 11544, pp. 219–236. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-34029-2_15
Tamaki, H.: A heuristic use of dynamic programming to upperbound treewidth. arXiv preprint arXiv:1909.07647 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Tamaki, H. (2020). Experimental Analysis of Treewidth. In: Fomin, F.V., Kratsch, S., van Leeuwen, E.J. (eds) Treewidth, Kernels, and Algorithms. Lecture Notes in Computer Science(), vol 12160. Springer, Cham. https://doi.org/10.1007/978-3-030-42071-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-42071-0_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-42070-3
Online ISBN: 978-3-030-42071-0
eBook Packages: Computer ScienceComputer Science (R0)