Postman tour on a graph with precedence relation on arcs (Q3787808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4051376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Postman tour on a graph with precedence relation on arcs |
scientific article; zbMATH DE number 4051376 |
Statements
Postman tour on a graph with precedence relation on arcs (English)
0 references
1987
0 references
Chinese Postman
0 references
precedence relation
0 references
polynomial complexity solution
0 references
minimum length
0 references
feasible postman tour
0 references
NP-complete
0 references
0.8143924474716187
0 references
0.8115516304969788
0 references
0.8091989159584045
0 references
0.8021273612976074
0 references
