Graph and Hypergraph Decompositions for Exact Algorithms

Janne Henrik Korhonen

Tutkimustuotos: OpinnäyteVäitöskirjaArtikkelikokoelma

Abstrakti

This thesis studies exact exponential and fixed-parameter algorithms for hard graph and hypergraph problems. Specifically, we study two techniques that can be used in the development of such algorithms: (i) combinatorial decompositions of both the input instance and the solution, and (ii) evaluation of multilinear forms over semirings.

In the first part of the thesis we develop new algorithms for graph and hypergraph problems based on techniques (i) and (ii). While these techniques are independently both useful, the work presented in this part is largely characterised by their joint application. That is, combining results from different pieces of the decompositions often takes the from of multilinear form evaluation task, and on the other hand, decompositions offer the basic structure for dynamic-programming-style algorithms for the evaluation of multilinear forms.

As main positive results of the first part, we give algorithms for three different problem families. First, we give a fast evaluation algorithm for linear forms defined by a disjointness matrix of small sets. This can be applied to obtain faster algorithms for counting maximum-weight objects of small size, such as k-paths in graphs. Second, we give a general framework for exponential-time algorithms for finding maximum-weight subgraphs of bounded tree-width, based on the theory of tree decompositions. Besides basic combinatorial problems, this framework has applications in learning Bayesian network structures. Third, we give a fixed-parameter algorithm for finding unbalanced vertex cuts, that is, vertex cuts that separate a small number of vertices from the rest of the graph.

In the second part of the thesis we consider aspects of the complexity theory of linear forms over semirings, in order to better understand technique (ii). Specifically, we study how the presence of different algebraic catalysts in the ground semiring affects the complexity. As the main result, we show that there are linear forms that are easy to compute over semirings with idempotent addition, but difficult to compute over rings, unless the strong exponential time hypothesis fails.
Alkuperäiskielienglanti
JulkaisupaikkaHelsinki
Kustantaja
Painoksen ISBN978-952-10-9638-9
Sähköinen ISBN978-952-10-9639-6
TilaJulkaistu - joulukuuta 2013
OKM-julkaisutyyppiG5 Tohtorinväitöskirja (artikkeli)

Tieteenalat

  • 113 Tietojenkäsittely- ja informaatiotieteet
  • 111 Matematiikka

Siteeraa tätä