60 citations · 165 across the 31 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Faster and simpler traversal of 0/1-polytopes
Jiří Fink, Petr Hladík, Arturo Merino +2
Recently, Merino and Mütze (FOCS'23+SICOMP'24) presented an algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope , where …
cs.DS2017
Distance-preserving graph contractions
Aaron Bernstein, Karl Däubel, Yann Disser +3
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a…
cs.DS2015
Efficient computation of middle levels Gray codes
Torsten Mütze, Jerri Nummenpalo
For any integer a middle levels Gray code is a cyclic listing of all bitstrings of length that have either or entries equal to 1 such that any two consec…