Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance (Q4987673)
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: Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance |
scientific article; zbMATH DE number 7342947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance |
scientific article; zbMATH DE number 7342947 |
Statements
Efficient algorithms for the reverse shortest path problem on trees under the hamming distance (English)
0 references
3 May 2021
0 references
inverse problems
0 references
shortest path problem
0 references
Hamming distance
0 references
combinatorial algorithms
0 references
0 references
0 references
0.8478168845176697
0 references
0.8130811452865601
0 references
0.8002484440803528
0 references
0.799295961856842
0 references
0.794844925403595
0 references
