60 citations · 165 across the 31 of their papers we have counts for
6 papers · 1 filter
A simple algorithm for computing Hamilton paths on independent set polytopes
Jean Cardinal, Pia Herkenrath, Torsten Mütze +1
The independent set polytope, or stable set polytope, of a graph is the 0/1-polytope defined by the convex hull of the characteristic vectors of all independent sets of . We…
Combinatorial generation via permutation languages. VI. Binary trees
Petr Gregor, Torsten Mütze, Namrata
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree pattern…
Traversing combinatorial 0/1-polytopes via optimization
Arturo Merino, Torsten Mütze
In this paper, we present a new framework that exploits combinatorial optimization for efficiently generating a large variety of combinatorial objects based on graphs, matroids, po…
Combinatorial generation via permutation languages. IV. Elimination trees
Jean Cardinal, Arturo Merino, Torsten Mütze
An elimination tree for a connected graph is a rooted tree on the vertices of obtained by choosing a root and recursing on the connected components of to produce…
Combinatorial generation via permutation languages. I. Fundamentals
Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze +1
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as perm…
A constant-time algorithm for middle levels Gray codes
Torsten Mütze, Jerri Nummenpalo
For any integer a middle levels Gray code is a cyclic listing of all -element and -element subsets of such that any two consecutive subset…