Abstract
Many hard algorithmic problems dealing with graphs, circuits, formulas and constraints admit polynomial-time upper bounds if the underlying graph has small treewidth. The same problems often encourage reducing the maximal degree of vertices to simplify theoretical arguments or address practical concerns. Such degree reduction can be performed through a sequence of splittings of vertices, resulting in an expansion of the original graph. We observe that the treewidth of a graph may increase dramatically if the splittings are not performed carefully. In this context we address the following natural question: is it possible to reduce the maximum degree to a constant without substantially increasing the treewidth?
We answer the above question affirmatively. We prove that any simple undirected graph G=(V,E) admits an expansion G′=(V′,E′) with the maximum degree ≤3 and tw(G′)≤tw(G)+1, where tw(⋅) is the treewidth of a graph. Furthermore, such an expansion will have no more than 2|E|+|V| vertices and 3|E| edges; it can be computed efficiently from a tree-decomposition of G. We also construct a family of examples for which the increase by 1 in treewidth cannot be avoided.
Similar content being viewed by others
References
Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: NP-hard graph problems and boundary classes of graphs. Theor. Comput. Sci. 389, 219–236 (2007)
Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237, 123–134 (2000)
Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebr. Discrete Methods 8(2), 277–284 (1987)
Berman, P., Fürer, M.: Approximating maximum independent set in bounded degree graphs. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 365–372 (1994)
Bodlaender, H.L.: Treewidth: Characterizations, applications, and computations. Technical Report UU-CS-2006-041, Institute of Information and Computing Sciences, Utrecht University (2006)
Dechter, R.: Bucket elimination: a unifying framework for reasoning. Artif. Intell. 113(1–2), 41–85 (1999)
Dechter, R., Pearl, J.: Network-based heuristics for constraint-satisfaction problems. Artif. Intell. 34(1), 1–38 (1987)
Dechter, R., Rish, I.: Directional resolution: the Davis-Putnam procedure revisited. In: Proc. Principles of Knowledge Representation and Reasoning (KR), pp. 134–145 (1994)
Dechter, R., Kask, K., Bin, E., Emek, R.: Generating random solutions for constraint-satisfaction problems. In: Proc. AAAI/IAAI, pp. 15–21 (2002)
Diestel, R.: Graph theory, 3rd edn. Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2005)
Håstad, J.: Clique is hard to approximate within n 1−ε. Acta Math. 182, 105–142 (1999)
Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. R. Stat. Soc. Ser. B 50(2), 157–224 (1988)
Markov, I.L., Shi, Y.: Simulating quantum computation by contracting tensor networks. SIAM J. Comput. 38(3), 963–981 (2008)
Markov, I.L., Shi, Y.: Simulating quantum computation by contracting tensor networks (2008). http://lanl.arxiv.org/abs/quant-ph/0511069v6
Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory, Ser. B 36(1), 49–64 (1984)
Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B 52(2), 153–190 (1991)
Saxena, P., Menezes, N., Cocchini, P., Kirkpatrick, D.A.: Repeater scaling and its impact on CAD. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 23(4), 451–463 (2004)
Zabiyaka, Y., Darwiche, A.: On tractability and hypertree width. Technical Report D–150, UCLA Computer Science (2007)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Markov, I.L., Shi, Y. Constant-Degree Graph Expansions that Preserve Treewidth. Algorithmica 59, 461–470 (2011). https://doi.org/10.1007/s00453-009-9312-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-009-9312-5