Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ali Ridha Mahjoub"'
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2012, 439, ⟨10.1016/j.tcs.2012.03.014⟩
Theoretical Computer Science, Elsevier, 2012, 439, ⟨10.1016/j.tcs.2012.03.014⟩
International audience; The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some precedence constraints specified by paths of the d