Login / Signup
On the complexity of the Eulerian closed walk with precedence path constraints problem.
Hervé Kerivin
Mathieu Lacroix
Ali Ridha Mahjoub
Published in:
Electron. Notes Discret. Math. (2010)
Keyphrases
</>
resource constraints
random walk
computational complexity
worst case
shortest path
computational cost
real time
lower bound
constraint satisfaction problems
constraint satisfaction
decision problems
linear constraints