Bounded Treewidth
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
On Treewidth and Graph Minors
On Treewidth and Graph Minors Daniel John Harvey Submitted in total fulfilment of the requirements of the degree of Doctor of Philosophy February 2014 Department of Mathematics and Statistics The University of Melbourne Produced on archival quality paper ii Abstract Both treewidth and the Hadwiger number are key graph parameters in structural and al- gorithmic graph theory, especially in the theory of graph minors. For example, treewidth demarcates the two major cases of the Robertson and Seymour proof of Wagner's Con- jecture. Also, the Hadwiger number is the key measure of the structural complexity of a graph. In this thesis, we shall investigate these parameters on some interesting classes of graphs. The treewidth of a graph defines, in some sense, how \tree-like" the graph is. Treewidth is a key parameter in the algorithmic field of fixed-parameter tractability. In particular, on classes of bounded treewidth, certain NP-Hard problems can be solved in polynomial time. In structural graph theory, treewidth is of key interest due to its part in the stronger form of Robertson and Seymour's Graph Minor Structure Theorem. A key fact is that the treewidth of a graph is tied to the size of its largest grid minor. In fact, treewidth is tied to a large number of other graph structural parameters, which this thesis thoroughly investigates. In doing so, some of the tying functions between these results are improved. This thesis also determines exactly the treewidth of the line graph of a complete graph. This is a critical example in a recent paper of Marx, and improves on a recent result by Grohe and Marx. -
Treewidth I (Algorithms and Networks)
Treewidth Algorithms and Networks Overview • Historic introduction: Series parallel graphs • Dynamic programming on trees • Dynamic programming on series parallel graphs • Treewidth • Dynamic programming on graphs of small treewidth • Finding tree decompositions 2 Treewidth Computing the Resistance With the Laws of Ohm = + 1 1 1 1789-1854 R R1 R2 = + R R1 R2 R1 R2 R1 Two resistors in series R2 Two resistors in parallel 3 Treewidth Repeated use of the rules 6 6 5 2 2 1 7 Has resistance 4 1/6 + 1/2 = 1/(1.5) 1.5 + 1.5 + 5 = 8 1 + 7 = 8 1/8 + 1/8 = 1/4 4 Treewidth 5 6 6 5 2 2 1 7 A tree structure tree A 5 6 P S 2 P 6 P 2 7 S Treewidth 1 Carry on! • Internal structure of 6 6 5 graph can be forgotten 2 2 once we know essential information 1 7 about it! 4 ¼ + ¼ = ½ 6 Treewidth Using tree structures for solving hard problems on graphs 1 • Network is ‘series parallel graph’ • 196*, 197*: many problems that are hard for general graphs are easy for e.g.: – Trees NP-complete – Series parallel graphs • Many well-known problems Linear / polynomial time computable 7 Treewidth Weighted Independent Set • Independent set: set of vertices that are pair wise non-adjacent. • Weighted independent set – Given: Graph G=(V,E), weight w(v) for each vertex v. – Question: What is the maximum total weight of an independent set in G? • NP-complete 8 Treewidth Weighted Independent Set on Trees • On trees, this problem can be solved in linear time with dynamic programming. -
The Travelling Salesman Problem in Bounded Degree Graphs*
The Travelling Salesman Problem in Bounded Degree Graphs? Andreas Bj¨orklund1, Thore Husfeldt1, Petteri Kaski2, and Mikko Koivisto2 1 Lund University, Department of Computer Science, P.O.Box 118, SE-22100 Lund, Sweden, e-mail: [email protected], [email protected] 2 Helsinki Institute for Information Technology HIIT, Department of Computer Science, University of Helsinki, P.O.Box 68, FI-00014 University of Helsinki, Finland, e-mail: [email protected], Abstract. We show that the travelling salesman problem in bounded- degree graphs can be solved in time O((2 − )n), where > 0 depends only on the degree bound but not on the number of cities, n. The algo- rithm is a variant of the classical dynamic programming solution due to Bellman, and, independently, Held and Karp. In the case of bounded in- teger weights on the edges, we also present a polynomial-space algorithm with running time O((2 − )n) on bounded-degree graphs. 1 Introduction There is no faster algorithm known for the travelling salesman problem than the classical dynamic programming solution from the early 1960s, discovered by Bellman [2, 3], and, independently, Held and Karp [9]. It runs in time within a polynomial factor of 2n, where n is the number of cities. Despite the half a cen- tury of algorithmic development that has followed, it remains an open problem whether the travelling salesman problem can be solved in time O(1.999n) [15]. In this paper we provide such an upper bound for graphs with bounded maximum vertex degree. For this restricted graph class, previous attemps have succeeded to prove such bounds when the degree bound, ∆, is three or four. -
Arxiv:2006.06067V2 [Math.CO] 4 Jul 2021
Treewidth versus clique number. I. Graph classes with a forbidden structure∗† Cl´ement Dallard1 Martin Milaniˇc1 Kenny Storgelˇ 2 1 FAMNIT and IAM, University of Primorska, Koper, Slovenia 2 Faculty of Information Studies, Novo mesto, Slovenia [email protected] [email protected] [email protected] Treewidth is an important graph invariant, relevant for both structural and algo- rithmic reasons. A necessary condition for a graph class to have bounded treewidth is the absence of large cliques. We study graph classes closed under taking induced subgraphs in which this condition is also sufficient, which we call (tw,ω)-bounded. Such graph classes are known to have useful algorithmic applications related to variants of the clique and k-coloring problems. We consider six well-known graph containment relations: the minor, topological minor, subgraph, induced minor, in- duced topological minor, and induced subgraph relations. For each of them, we give a complete characterization of the graphs H for which the class of graphs excluding H is (tw,ω)-bounded. Our results yield an infinite family of χ-bounded induced-minor-closed graph classes and imply that the class of 1-perfectly orientable graphs is (tw,ω)-bounded, leading to linear-time algorithms for k-coloring 1-perfectly orientable graphs for every fixed k. This answers a question of Breˇsar, Hartinger, Kos, and Milaniˇc from 2018, and one of Beisegel, Chudnovsky, Gurvich, Milaniˇc, and Servatius from 2019, respectively. We also reveal some further algorithmic implications of (tw,ω)- boundedness related to list k-coloring and clique problems. In addition, we propose a question about the complexity of the Maximum Weight Independent Set prob- lem in (tw,ω)-bounded graph classes and prove that the problem is polynomial-time solvable in every class of graphs excluding a fixed star as an induced minor. -
On Snarks That Are Far from Being 3-Edge Colorable
On snarks that are far from being 3-edge colorable Jonas H¨agglund Department of Mathematics and Mathematical Statistics Ume˚aUniversity SE-901 87 Ume˚a,Sweden [email protected] Submitted: Jun 4, 2013; Accepted: Mar 26, 2016; Published: Apr 15, 2016 Mathematics Subject Classifications: 05C38, 05C70 Abstract In this note we construct two infinite snark families which have high oddness and low circumference compared to the number of vertices. Using this construction, we also give a counterexample to a suggested strengthening of Fulkerson's conjecture by showing that the Petersen graph is not the only cyclically 4-edge connected cubic graph which require at least five perfect matchings to cover its edges. Furthermore the counterexample presented has the interesting property that no 2-factor can be part of a cycle double cover. 1 Introduction A cubic graph is said to be colorable if it has a 3-edge coloring and uncolorable otherwise. A snark is an uncolorable cubic cyclically 4-edge connected graph. It it well known that an edge minimal counterexample (if such exists) to some classical conjectures in graph theory, such as the cycle double cover conjecture [15, 18], Tutte's 5-flow conjecture [19] and Fulkerson's conjecture [4], must reside in this family of graphs. There are various ways of measuring how far a snark is from being colorable. One such measure which was introduced by Huck and Kochol [8] is the oddness. The oddness of a bridgeless cubic graph G is defined as the minimum number of odd components in any 2-factor in G and is denoted by o(G). -
Handout on Vertex Separators and Low Tree-Width K-Partition
Handout on vertex separators and low tree-width k-partition January 12 and 19, 2012 Given a graph G(V; E) and a set of vertices S ⊂ V , an S-flap is the set of vertices in a connected component of the graph induced on V n S. A set S is a vertex separator if no S-flap has more than n=p 2 vertices. Lipton and Tarjan showed that every planar graph has a separator of size O( n). This was generalized by Alon, Seymour and Thomas to any family of graphs that excludes some fixed (arbitrary) subgraph H as a minor. Theorem 1 There a polynomial time algorithm that given a parameter h and an n vertex graphp G(V; E) either outputs a Kh minor, or outputs a vertex separator of size at most h hn. Corollary 2 Let G(V; E) be an arbitrary graph with nop Kh minor, and let W ⊂ V . Then one can find in polynomial time a set S of at most h hn vertices such that every S-flap contains at most jW j=2 vertices from W . Proof: The proof given in class for Theorem 1 easily extends to this setting. 2 p Corollary 3 Every graph with no Kh as a minor has treewidth O(h hn). Moreover, a tree decomposition with this treewidth can be found in polynomial time. Proof: We have seen an algorithm that given a graph of treewidth p constructs a tree decomposition of treewidth 8p. Usingp Corollary 2, that algorithm can be modified to give a tree decomposition of treewidth 8h hn in our case, and do so in polynomial time. -
Complexity and Approximation Results for the Connected Vertex Cover Problem in Graphs and Hypergraphs Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs Bruno Escoffier, Laurent Gourvès, Jérôme Monnot To cite this version: Bruno Escoffier, Laurent Gourvès, Jérôme Monnot. Complexity and approximation results forthe connected vertex cover problem in graphs and hypergraphs. 2007. hal-00178912 HAL Id: hal-00178912 https://hal.archives-ouvertes.fr/hal-00178912 Preprint submitted on 12 Oct 2007 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Laboratoire d'Analyse et Modélisation de Systèmes pour l'Aide à la Décision CNRS UMR 7024 CAHIER DU LAMSADE 262 Juillet 2007 Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs Bruno Escoffier, Laurent Gourvès, Jérôme Monnot Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs Bruno Escoffier∗ Laurent Gourv`es∗ J´erˆome Monnot∗ Abstract We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal graphs, has a PTAS in planar graphs, is APX-hard in bipartite graphs and is 5/3-approximable in any class of graphs where the vertex cover problem is polynomial (in particular in bipartite graphs). -
The Size Ramsey Number of Graphs with Bounded Treewidth | SIAM
SIAM J. DISCRETE MATH. © 2021 Society for Industrial and Applied Mathematics Vol. 35, No. 1, pp. 281{293 THE SIZE RAMSEY NUMBER OF GRAPHS WITH BOUNDED TREEWIDTH\ast NINA KAMCEVy , ANITA LIEBENAUz , DAVID R. WOOD y , AND LIANA YEPREMYANx Abstract. A graph G is Ramsey for a graph H if every 2-coloring of the edges of G contains a monochromatic copy of H. We consider the following question: if H has bounded treewidth, is there a \sparse" graph G that is Ramsey for H? Two notions of sparsity are considered. Firstly, we show that if the maximum degree and treewidth of H are bounded, then there is a graph G with O(jV (H)j) edges that is Ramsey for H. This was previously only known for the smaller class of graphs H with bounded bandwidth. On the other hand, we prove that in general the treewidth of a graph G that is Ramsey for H cannot be bounded in terms of the treewidth of H alone. In fact, the latter statement is true even if the treewidth is replaced by the degeneracy and H is a tree. Key words. size Ramsey number, bounded treewidth, bounded-degree trees, Ramsey number AMS subject classifications. 05C55, 05D10, 05C05 DOI. 10.1137/20M1335790 1. Introduction. A graph G is Ramsey for a graph H, denoted by G ! H, if every 2-coloring of the edges of G contains a monochromatic copy of H. In this paper we are interested in how sparse G can be in terms of H if G ! H. -
Switching 3-Edge-Colorings of Cubic Graphs Arxiv:2105.01363V1 [Math.CO] 4 May 2021
Switching 3-Edge-Colorings of Cubic Graphs Jan Goedgebeur Department of Computer Science KU Leuven campus Kulak 8500 Kortrijk, Belgium and Department of Applied Mathematics, Computer Science and Statistics Ghent University 9000 Ghent, Belgium [email protected] Patric R. J. Osterg˚ard¨ Department of Communications and Networking Aalto University School of Electrical Engineering P.O. Box 15400, 00076 Aalto, Finland [email protected] In loving memory of Johan Robaey Abstract The chromatic index of a cubic graph is either 3 or 4. Edge- Kempe switching, which can be used to transform edge-colorings, is here considered for 3-edge-colorings of cubic graphs. Computational results for edge-Kempe switching of cubic graphs up to order 30 and bipartite cubic graphs up to order 36 are tabulated. Families of cubic graphs of orders 4n + 2 and 4n + 4 with 2n edge-Kempe equivalence classes are presented; it is conjectured that there are no cubic graphs arXiv:2105.01363v1 [math.CO] 4 May 2021 with more edge-Kempe equivalence classes. New families of nonplanar bipartite cubic graphs with exactly one edge-Kempe equivalence class are also obtained. Edge-Kempe switching is further connected to cycle switching of Steiner triple systems, for which an improvement of the established classification algorithm is presented. Keywords: chromatic index, cubic graph, edge-coloring, edge-Kempe switch- ing, one-factorization, Steiner triple system. 1 1 Introduction We consider simple finite undirected graphs without loops. For such a graph G = (V; E), the number of vertices jV j is the order of G and the number of edges jEj is the size of G. -
Treewidth-Erickson.Pdf
Computational Topology (Jeff Erickson) Treewidth Or il y avait des graines terribles sur la planète du petit prince . c’étaient les graines de baobabs. Le sol de la planète en était infesté. Or un baobab, si l’on s’y prend trop tard, on ne peut jamais plus s’en débarrasser. Il encombre toute la planète. Il la perfore de ses racines. Et si la planète est trop petite, et si les baobabs sont trop nombreux, ils la font éclater. [Now there were some terrible seeds on the planet that was the home of the little prince; and these were the seeds of the baobab. The soil of that planet was infested with them. A baobab is something you will never, never be able to get rid of if you attend to it too late. It spreads over the entire planet. It bores clear through it with its roots. And if the planet is too small, and the baobabs are too many, they split it in pieces.] — Antoine de Saint-Exupéry (translated by Katherine Woods) Le Petit Prince [The Little Prince] (1943) 11 Treewidth In this lecture, I will introduce a graph parameter called treewidth, that generalizes the property of having small separators. Intuitively, a graph has small treewidth if it can be recursively decomposed into small subgraphs that have small overlap, or even more intuitively, if the graph resembles a ‘fat tree’. Many problems that are NP-hard for general graphs can be solved in polynomial time for graphs with small treewidth. Graphs embedded on surfaces of small genus do not necessarily have small treewidth, but they can be covered by a small number of subgraphs, each with small treewidth. -
Snarks and Flow-Critical Graphs 1
Snarks and Flow-Critical Graphs 1 CˆandidaNunes da Silva a Lissa Pesci a Cl´audioL. Lucchesi b a DComp – CCTS – ufscar – Sorocaba, sp, Brazil b Faculty of Computing – facom-ufms – Campo Grande, ms, Brazil Abstract It is well-known that a 2-edge-connected cubic graph has a 3-edge-colouring if and only if it has a 4-flow. Snarks are usually regarded to be, in some sense, the minimal cubic graphs without a 3-edge-colouring. We defined the notion of 4-flow-critical graphs as an alternative concept towards minimal graphs. It turns out that every snark has a 4-flow-critical snark as a minor. We verify, surprisingly, that less than 5% of the snarks with up to 28 vertices are 4-flow-critical. On the other hand, there are infinitely many 4-flow-critical snarks, as every flower-snark is 4-flow-critical. These observations give some insight into a new research approach regarding Tutte’s Flow Conjectures. Keywords: nowhere-zero k-flows, Tutte’s Flow Conjectures, 3-edge-colouring, flow-critical graphs. 1 Nowhere-Zero Flows Let k > 1 be an integer, let G be a graph, let D be an orientation of G and let ϕ be a weight function that associates to each edge of G a positive integer in the set {1, 2, . , k − 1}. The pair (D, ϕ) is a (nowhere-zero) k-flow of G 1 Support by fapesp, capes and cnpq if every vertex v of G is balanced, i. e., the sum of the weights of all edges leaving v equals the sum of the weights of all edges entering v. -
Treewidth: Computational Experiments
Takustraße 7 Konrad-Zuse-Zentrum D-14195 Berlin-Dahlem fur¨ Informationstechnik Berlin Germany ARIE M.C.A. KOSTER HANS L. BODLAENDER STAN P.M. VAN HOESEL Treewidth: Computational Experiments ZIB-Report 01–38 (December 2001) Treewidth: Computational Experiments Arie M.C.A. Kostery Hans L. Bodlaenderz Stan P.M. van Hoeselx December 28, 2001 Abstract Many NP-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can success- fully be applied to ¯nd (almost) optimal solutions or lower bounds for many optimization problems. To apply a tree decomposition approach, the treewidth of the graph has to be determined, independently of the application at hand. Although for ¯xed k, linear time algorithms exist to solve the decision problem \treewidth · k", their practical use is very limited. The computational tractability of treewidth has been rarely studied so far. In this paper, we compare four heuristics and two lower bounds for instances from applications such as the frequency assignment problem and the vertex coloring problem. Three of the heuristics are based on well-known algorithms to recognize triangulated graphs. The fourth heuristic recursively improves a tree decomposition by the computation of minimal separating vertex sets in subgraphs. Lower bounds can be computed from maximal cliques and the minimum degree of induced subgraphs. A computational analysis shows that the treewidth of several graphs can be identi¯ed by these methods. For other graphs, however, more sophisticated techniques are necessary.