bn:01061238n
Noun Concept
Categories: Travelling salesman problem, PSPACE-complete problems, Computational problems in graph theory
EN
Canadian traveller problem  CTP
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
Definitions
Relations
Sources
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
A shortest path problem Wikipedia Disambiguation
generalization of the shortest path problem to graphs that are partially observable Wikidata
A generalization of the shortest path problem to graphs that are only partially observable (i.e. the graph is revealed while it is being explored). Wiktionary
Wikipedia Redirections
Wikidata Alias
EN
CTP