An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10957-018-1221-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2787763202 / rank | |||
Normal rank | |||
Revision as of 18:57, 19 March 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
