10 citations · 10 across the 3 of their papers we have counts for
1 paper · 1 filter
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…