Login / Signup
On the complexity of the Eulerian closed walk with precedence path constraints problem.
Hervé Kerivin
Mathieu Lacroix
Ali Ridha Mahjoub
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
resource constraints
linear constraints
constrained optimization
worst case
shortest path
constraint satisfaction
precedence constraints
computational complexity
complexity bounds
database
databases
data mining
random walk
precedence relations