An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance |
scientific article; zbMATH DE number 6931963
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance |
scientific article; zbMATH DE number 6931963 |
Statements
An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (English)
0 references
4 September 2018
0 references
shortest path problem
0 references
rooted trees
0 references
network improvement problem
0 references
Hamming distance
0 references
dynamic programming
0 references
0 references
0 references
0.93540907
0 references
0.92141473
0 references
0.9205047
0 references
0.9201432
0 references
0.9130564
0 references
0.91236764
0 references
0.9121635
0 references
