Search alternatives:
"NP-hard" » "NP-had", "NP-hand"
Cover Image
Read Now

1
Published 1995
Springer Berlin Heidelberg
Table of Contents: “...Nearest neighbour graph realizability is NP-hard -- Linear-time algorithms for parametric minimum...”