首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A note on the unsolvability of the weighted region shortest path problem
Institution:1. Computational Geometry Lab, School of Computer Science, Carleton University, Ottawa, Canada;2. Institut für Simulation und Graphik, Fakutät für Informatik, Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany;3. Department of Mathematics and Computer Science, Lehman College, City University of New York, Bronx, United States
Abstract:
Keywords:Computational geometry  Weighted region shortest paths  Galois theory  Unsolvability
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号