route inspection problem (Q901096)
Jump to navigation
Jump to search
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
|
Statements
Route inspection problem
0 references
Identifiers
Sitelinks
Wikipedia(20 entries)
- cswiki Problém čínského listonoše
- dewiki Briefträgerproblem
- enwiki Chinese postman problem
- eswiki Problema del cartero chino
- euwiki Postari txinatarraren ebazkizun
- fawiki مسئله پستچی چینی
- frwiki Problème du postier chinois
- hewiki בעיית הדוור הסיני
- hrwiki Problem kineskog poštara
- huwiki Kínaipostás-probléma
- itwiki Problema del postino cinese
- jawiki 中国人郵便配達問題
- nlwiki Chinees postbodeprobleem
- plwiki Problem chińskiego listonosza
- ptwiki Problema da inspeção de rotas
- ruwiki Задача китайского почтальона
- simplewiki Chinese postman problem
- ukwiki Задача листоноші
- viwiki Bài toán người đưa thư Trung Hoa
- zhwiki 中国邮递员问题
Wikibooks(0 entries)
Wikinews(0 entries)
Wikiquote(0 entries)
Wikisource(0 entries)
Wikiversity(0 entries)
Wikivoyage(0 entries)
Wiktionary(0 entries)
Multilingual sites(1 entry)
- commonswiki Category:Route inspection problem