Q901096

From Wikidata
Jump to: navigation, search

Route inspection problem(Q901096)

In graph theory, the Chinese postman problem (CPP) or Route inspection problem, is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph
  • Chinese postman problem
[edit]
Language Label Description Also known as
English
Route inspection problem
In graph theory, the Chinese postman problem (CPP) or Route inspection problem, is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph
  • Chinese postman problem

Statements

/m/01779b
1 reference