bn:01061238n
Noun Concept
AR
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