--
Matthieu Petiteau
(Université Grenoble Alpes)
summary: Let G = (V, E) be a connected graph and T be a subset of the vertices.
An orientation of G is a choice of a direction for each edge of the graph, it
is said to be acylic if does not contain any directed cycle. An orientation of G ...
