In the database context, the hypertree decomposition method is used for query optimization,
whereby conjunctive queries having a low degree of cyclicity can be recognized and …

Exact exponential algorithms Page 1 80 coMMunicATions of ThE AcM | MARCh 2013 | Vol. 56
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …

Graph theory, a fundamental branch of mathematics, centers on the study of networks
composed of vertices (nodes) and edges, examining their paths, structures, and properties …

The study of graph structure has advanced in recent years with great strides: finite graphs
can be described algebraically, enabling them to be constructed out of more basic elements …

For more than 40 years, Branch & Reduce exponential-time backtracking algorithms have
been among the most common tools used for finding exact solutions of NP-hard problems …

There are many graph problems that can be solved in linear or polynomial time with a
dynamic programming algorithm when the input graph has bounded treewidth. For …

For more and more applications, it is important to be able to compute the treewidth of a given
graph and to find tree decompositions of small width reasonably fast. This paper gives an …

In this work, we present a new large-scale quantum circuit simulator. It is based on the
tensor network contraction technique to represent quantum circuits. We propose a novel …

Consider a dynamic programming scheme for a decision problem in which all subproblems
involved are also decision problems. An implementation of such a scheme is positive …

We consider various well-known, equivalent complexity measures for graphs such as
elimination orderings, k-trees and cops and robber games and study their natural …