Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"Computational Geomery"”.
-
Complexity of Minimum Corridor Guarding Problems
… problems are proved to be NP-complete. Keywords: computational complexity, computational geometry, corridor guarding, NP-complete"