60 citations · 165 across the 31 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DM2026
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…
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 …
math.CO2026
Hamilton paths and cycles in flip graphs of (almost-)perfect matchings
Sofia Brenner, Justin Dallant, Linda Kleist +3
We consider the set of matchings of a graph and a local change operation, called a flip, between them. In the combinatorial setting, the base graphs are either complete graphs or c…