The Internet Archive has a preservation copy of this work in our general collections.
The file type is
An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that admit a directed source-target path. This problem has recently arisen in the study of biological networks, and it also has applications in communication networks. In this paper, we identify an interesting local-to-global orientation property. This propertyarXiv:1204.0219v1 fatcat:ki5fsv74mrcrbdh2sktyxl6fd4