HAL Id: hal-00921775

[15] presented a polynomial algorithm for the problem of orienting an undirected graph so as to maximize the number of source-target pairs out of all possible ordered vertex pairs that