10 citations · 10 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Switches in Eulerian graphs
Ahad N. Zehmakan, Jerri Nummenpalo, Alexander Pilz +1
We show that the graph transformation problem of turning a simple graph into an Eulerian one by a minimum number of single edge switches is NP-hard. Further, we show that any simpl…
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…