Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...