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 10 of 10 for “"treewidth"”.
-
The bidimensionality theory and its algorithmic applications
… embeddable in a surface of bounded genus has treewidth bounded above by the square root of the problem's solution value. These properties lead to efficient-often subexponential-fixed-parameter algorithms, as well as polynomial-time approximation schemes, for many minor-closed graph classes. …
-
Constant time algorithms in sparse graph model
… partitioning oracle for graphs with constant treewidth. Although the partitioning oracle in Chapter 2 runs in time independent of the size of the input graph, it has to make 2POlY(1/E)) queries to the input graph to answer a query about the partition. Our new partitioning oracle improves this …
-
Game comonads and beyond: compositional constructions for logic and algorithms
… isomorphism, and well-known parameters such as treewidth and treedepth. The compositional framework for logical resources emerging from these comonads has proved an important tool in generalising results from finite model theory and new game comonads have been invented for a range of different …
-
Analysis and Optimization of Communication Networks with Flow Requirements
… graph classes, namely graphs with restricted treewidth, edge-transitive graphs and the complete graph.
-
Complexity of Dyck-reachability in directed graphs
… st-Dyck-reachability for graphs with bounded treewidth and using a bounded stack.
-
Exploiting chordal structure in systems of polynomial equations
Chordal structure and bounded treewidth allow for efficient computation in linear algebra, graphical models, constraint satisfaction and many other areas. Nevertheless, it has not been studied whether chordality might also help solve systems of polynomials. We propose a new technique, which we …
-
Structure in Machine Learning: Graphical Models and Monte Carlo Methods
… graph corresponding to the model (such as low treewidth), or restrictions on the types of potential functions that may be present in the model (such as log-supermodularity). We contribute two new classes of exactness guarantees: the first of these takes the form of particular hybrid …
-
Approximation algorithms for submodular optimization and graph problems
… and Shepherd on the connection between the treewidth of the graph and the existence of a good routing structure. Additionally, we initiate the study of integral throughput flow problems in directed graphs with symmetric demand pairs. We obtain a poly-logarithmic approximation with constant …
-
Polynomial systems : graphical structure, geometry, and applications
… operations, where [superscript w] is the treewidth of its bipartite adjacency graph. We also investigate the complexity of some related problems, including mixed discriminants, hyperdeterminants, and mixed volumes. Although seemingly unrelated to polynomial systems, our results have …
-
Easy instances for model checking
Our interest is focused on the complexity of the model-checking problem and its generalizations. This question is intimately related to the expressibility of the logical language in question. We investigate the parameterized complexity of queries expressible in monadic second order logic over …