Skip to Main Content
Keywords: Floyd’s algorithm
Close
Follow your search
Access your saved searches in your account

Would you like to receive an alert when new items match your search?
Close Modal
Sort by
Journal Articles
International Journal of Intelligent Computing and Cybernetics (2017) 10 (1): 30–40.
Published: 13 March 2017
... on a neighbourhood graph. The classical Isomap (C-Isomap) is very slow, due to the use of Floyd’s algorithm to compute the shortest paths. The purpose of this paper is to speed up Isomap. Design/methodology/approach Through theoretical analysis, it is found that the neighbourhood graph in Isomap is sparse...

or Create an Account

Close Modal
Close Modal