On the Hardness of Equal Shortest Path Routing.

Frédéric Giroire Stéphane Pérennes Issam Tahiri

Published in: Electron. Notes Discret. Math. (2013)

Keyphrases

computational complexity
phase transition
np complete
np hard
image sequences
motion estimation
information theoretic
constraint satisfaction
learning theory
np hardness