route inspection problem
Sign in to saveAlso known as Chinese postman problem, Guan's route problem, postman tour
in graph theory, the problem to find a shortest closed path or circuit that visits every edge of an undirected graph
Wikidata facts
- Instance of
- computational problem
- Image
- Chinese postman problem.svg
Show 3 more facts
- maintained by WikiProject
- WikiProject Mathematics
- Commons category
- Route inspection problem
- computational complexity
- P
Sources (1)
via Wikidata · CC0