Abstract
Most algorithmic strategies for solving problems considering treewidth parameterization require that a tree decomposition is given. Given a graph \(G=(V,E)\) and denoting by \(\mathcal {C_G}\) the family of chordal graphs (triangulations) \(G'\) such that \(V(G)=V(G')\) and \( E(G)\subseteq E(G')\), the treewidth of a graph G can be defined alternatively as the size of the smallest maximum clique of a graph in \(\mathcal {C_G}\), minus one. In addition, any tree decomposition \(\mathcal {T}\) of a graph \(G'\in \mathcal {C_G}\) is also a tree decomposition of G. In this paper, we are interested in the main subproblem to be solved by the most popular heuristics for treewidth computation, called Tree Decomposition Decoding. In such a problem, we are given a graph \(G=(V, E)\) and a permutation \(\rho \) of V(G) and asked to determine the width of the tree decomposition \(\mathcal {T}\) of G that is an optimum tree decomposition of the minimal triangulation \(G'\in \mathcal {C_G}\) having \(\rho \) as perfect elimination ordering. From \((G,\rho )\), it is easy to find the solution to the problem by first constructing the triangulation \(G'\) arising from \(\rho \). However, in the worst case, such constructions of \(G'\) require \(\varTheta (|V(G)|^2)\) space. In this work, we propose two algorithms for solving the problem; both avoid the construction of triangulations \(G'\). The first performers in \(\mathcal {O}(|V(G)|\cdot \ell )\) space and \(\mathcal {O}(|V(G)|^2\cdot \ell )\) time, where \(\ell \) is the number of leaves of the tree decomposition encoded by \(\rho \). The second is faster in practice and achieves a different trade-off, solving the problem within \(\mathcal {O}(|E(G)| + |V(G)|)\) space and \(\mathcal {O}(|E(G)|\cdot \log |V(G)|)\) time.
This research has received funding from Rio de Janeiro Research Support Foundation (FAPERJ) and National Council for Scientific and Technological Development (CNPq).
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(2), 277–284 (1987)
Bannach, M., Berndt, S., Ehlers, T.: Jdrasil: a modular library for computing tree decompositions. In: 16th International Symposium on Experimental Algorithms (SEA 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)
Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154–160 (1994)
Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
Dell, H., Komusiewicz, C., Talmon, N., Weller, M.: The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration. In: Lokshtanov, D., Nishimura, N. (eds.) 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), Volume 89 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 30:1–30:12. Dagstuhl (2018)
Dirac, G.A.: On rigid circuit graphs. Abh. Math. Semin. Univ. Hambg. 25, 71–76 (1961). https://doi.org/10.1007/BF02992776
Fulkerson, D., Gross, O.: Incidence matrices and interval graphs. Pac. J. Math. 15(3), 835–855 (1965)
Galinier, P., Habib, M., Paul, C.: Chordal graphs and their clique graphs. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 358–371. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60618-1_88
Gaspers, S., Gudmundsson, J., Jones, M., Mestre, J., Rümmele, S.: Turbocharging treewidth heuristics. Algorithmica 81(2), 439–475 (2019). https://doi.org/10.1007/s00453-018-0499-1
Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266–283 (1976)
Tamaki, H.: Positive-instance driven dynamic programming for treewidth. J. Comb. Optim. 37(4), 1283–1311 (2019). https://doi.org/10.1007/s10878-018-0353-z
Wu, K., Otoo, E.: A simpler proof of the average case complexity of union-find withpath compression. Technical report, Lawrence Berkeley National Lab. (LBNL), Berkeley, CA, United States (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
da Silva, S.E., Souza, U.S. (2024). Decoding Tree Decompositions from Permutations. In: Soto, J.A., Wiese, A. (eds) LATIN 2024: Theoretical Informatics. LATIN 2024. Lecture Notes in Computer Science, vol 14578. Springer, Cham. https://doi.org/10.1007/978-3-031-55598-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-55598-5_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-55597-8
Online ISBN: 978-3-031-55598-5
eBook Packages: Computer ScienceComputer Science (R0)