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 1 of 1 for “"Räuber-und-Gendarm-Spiel"”.

  1. Width functions for hypertree decompositions

    Tree-width, a fundamental notion in graph structure theory, measures how far a graph is from being acyclic. When applied to the underlying graph of a hypergraph or a model-theoretic structure (such as a database, a database query, or an instance of a constraint satisfaction problem) it also gives …

    freiburg-diss Repository record for Width functions for hypertree decompositions (opens in a new tab)