June 2003 (v1)
Journal article
In this paper we consider a combinatorial problem consisting in finding an acyclic orientation of a graph which minimizes the maximum number of changes of orientations along a given set of dipaths. A change of orientation along a dipath occurs when two consecutive arcs are discordly oriented. Such maximum number of changes of orientations is...
Uploaded on: December 3, 2022