Nathan Yu

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Abstract Milling problem is a natural and quite general graph-theoretic model for geometric milling problems. Given a graph, one asks for a walk that covers all its vertices with a minimum number of turns, as specified in the graph model by a 0/1 turncost function fx at each vertex x giving, for each ordered pair of edges (e, f) incident at x, the turn(More)
  • 1