(Q901096)

English

route inspection problem

in graph theory, the problem to find a shortest closed path or circuit that visits every edge of an undirected graph

  • Chinese postman problem
  • Guan's route problem
  • postman tour

Statements

Identifiers