Search and delivery man problems: when are depth-first paths optimal? (Q2184055)
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 7205697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Search and delivery man problems: when are depth-first paths optimal? |
scientific article; zbMATH DE number 7205697 |
Statements
Search and delivery man problems: when are depth-first paths optimal? (English)
0 references
27 May 2020
0 references
networks
0 references
depth-first search
0 references
delivery man problem
0 references
trees
0 references
0 references
0 references
0.7856172323226929
0 references
0.7792097330093384
0 references
0.7706089615821838
0 references
0.7500675320625305
0 references
0.7324212789535522
0 references
