Minimizing maximum indegree Original Research Article

We study the problem of orienting the edges of a given simple graph so that the maximum indegree of nodes is minimized. We also develop an algorithm to produce such an extremal orientation on any given simple graph.