An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10957-018-1221-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10957-018-1221-9 / rank | |||
Normal rank | |||
Latest revision as of 02:09, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance |
scientific article |
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
