In this case, by exactly formulating the non-crossing scaffold routeing problem as a search for a specific type of Eulerian circuits in polyhedral graphs and then connecting this search problem to ...