Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 68 for “"treewidth"”.
-
On the relation between treewidth and toughness
Τα προβλήματα υπολογισμού του δενδροπλάτους και της σκληρότητας ενός γραφήματος είναι γνωστά NP-hard προβλήματα. Το δενδροπλάτος ειναι ένα μέτρο συνεκτικότητας των γραφημάτων, καθώς και ένα μέτρο αποδοτικού υπολογισμού για γνωστά NP-δύσκολα προβλήματα ορισμένα σε γραφήματα. Η σκληρότητα από την …
-
Tractable Learning and Inference in High-Treewidth Graphical Models
Probabilistic graphical models, by making conditional independence assumptions, can represent complex joint distributions in a factorized form. However, in large problems graphical models often run into two issues. First, in non-treelike graphs, computational issues frustrate exact inference. There …
-
Searching for Optimal Caterpillars in General and Bounded Treewidth Graphs
… an optimal solution for the MSCP in bounded treewidth graphs is given in Chapter 4. Our algorithm is fast and practical for outer-planar, series parallel, Halin graphs and other graphs with small treewidth.
-
New algorithms for pathwidth computation
The notions of pathwidth and the closely related treewidth have become more and more important recently. The importance lies not only in theory but also in practice. Theoretically, lots of NP-hard problems become polynomially solvable when restricted in graphs with bounded pathwidth (or treewidth). …
-
Graph Colouring and Decomposition
… partitions and the earlier notion of layered treewidth. We show that these two notions are strongly separated, so graphs admitting layered partitions are considerably more restricted than graphs with small layered treewidth. This work helps to explain why so much recent progress has been made …
-
Foreshadowing the Grid Theorem for Induced Subgraphs
… induced subgraphs of graphs with large treewidth. This is motivated by the Grid Theorem of Robertson and Seymour (1986) which achieves the same goal for minors (and subgraphs). Given a graph class C, we say that C is clean if the only induced subgraph obstructions to bounded treewidth in …
-
Practical tractability of CSPs by higher level consistency and tree decomposition
… relates the consistency level of a CSP to treewidth of the CSP's constraint network. However, enforcing higher levels of consistency on a CSP may require the addition of constraints, thus altering the topology of the constraint network and increasing its treewidth. This thesis addresses the …
-
Topics in Graph Algorithms: Structural Results and Algorithmic Techniques, with Applications
… consequences. We discuss graph metrics such as treewidth and pathwidth. Treewidth is well studied, mainly because many problems that are NP-hard in general have polynomial time algorithms when restricted to graphs of bounded treewidth. Pathwidth has many applications ranging from circuit layout …
-
Graph colourings and games
… complexity of list problems on graphs of bounded treewidth. We prove structural results determining the list edge chromatic number and list total chromatic number of graphs with bounded treewidth and large maximum degree, which are special cases of the List (Edge) Colouring Conjecture and Total …
-
Parameterized complexity in graph theory, logic and machine learning
… settings. While structural parameters like treewidth are typically associated with graph algorithms, we expand their application to solve hard problems in three distinct domains: Graph Drawing, Explainable AI (XAI), and Logic. First, the thesis addresses the Two-Page Book Embedding problem …
-
ΔΙΑΤΑΞΕΙΣ ΔΙΑΓΡΑΦΩΝ, ΠΑΙΧΝΙΔΙΑ ΚΑΙ ΕΛΑΣΣΟΝΑ ΣΕ ΓΡΑΦΗΜΑΤΑ
… SEARCH GAME FOR THE PARAMETERS OF WIDTH AND TREEWIDTH OF A GRAPH AND STUDY OF THE BEHAVIOR OF THIS GAME ON GRAPHS WITH BOUNDED CHORDALITY. 5) EXCLUSION (AS A MINOR) OF THE GRAPH K2,R FROM GENERAL AND PLANAR GRAPHS. 6) PROOF OF THE CLOSSEDNESS UNDER TAKING OF MINORS OF THE CLASS OF GRAPHS ON …
-
Grid Minors and Products
… of planar graphs, we study relationships between treewidth, grid minors, and graph products. We show that the Cartesian product of any two graphs, each connected and each having n vertices, contains an Ω(√n) × Ω(√n) grid minor. This result is tight: the lexicographic product (which includes the …
-
Representations and Parameterizations of Combinatorial Auctions
… focuses on the item graph representation and its treewidth, a property of a graph that measures how close the graph is to a tree. From a result by Gavril, if an item graph has treewidth one, then the bid graph must be chordal [16]. To apply the other direction of Gavril’s theorem, we use our new …
-
Graph reconstruction and structure
… classes to be described using graphs of bounded treewidth. Having first appeared in 2019, this theory is still actively under development, but has already facilitated progress on longstanding problems. As a new application in the intersection of structural and geometric graph theory, we use it to …
-
Homogeneous sets in graphs and hypergraphs
… number of a bag in a tree decomposition as a new treewidth measure. We explain how to use this measure, defined as minor-matching treewidth, to solve hard problems and how to algorithmically construct a tree decomposition with approximate minimal width.</p>
Page 1 of 4