Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Search syntax
s:d sort by date
r:uk uk region
site: domain search
\ search first result
More...
r:n turn off region
!a search search amazon
site:uk uk pages
f: find files
t: within title
b: within body
More explanation...
Canadian traveller problem
In computer science and graph theory, the Canadian Traveller Problem (CTP) is a generalization of the shortest path problem to graphs that are partially observable.
More at Wikipedia
Shortest path problem
Hitting time
More related topics
Graph traversal
PSPACE-complete problems
Computational problems in graph theory
Operations research
This page requires Javascript.Get the non-JS version
here
.