2 papers
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.DM2017
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
We investigate parameterizing hard combinatorial problems by the size of the solution set compared to all solution candidates. Our main result is a uniform sampling algorithm for s…