Login / Signup
The hardness of routing two pairs on one face.
Guyslain Naves
Published in:
Math. Program. (2012)
Keyphrases
</>
pairwise
human faces
face images
facial expressions
wireless ad hoc networks
routing problem
information theoretic
computational complexity
face identification
multicast routing
computer vision
mobile ad hoc networks
routing algorithm
recognition algorithm
routing protocol
keypoints
shortest path
np complete
np hard