Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01061238n
Noun Concept
FR
No term available
EN
In computer science and graph theory, the Canadian Traveller Problem is a generalization of the shortest path problem to graphs that are partially observable. Wikipedia
Relations
Sources
IS A
problème d'optimisation
DISCOVERER OR INVENTOR
Mihalis Yannakakis
Christos Papadimitriou
NAMED AFTER
Canada

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License