The quickest root-leaf interdiction problem on tree networks (Q6995828)
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 8028595
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The quickest root-leaf interdiction problem on tree networks |
scientific article; zbMATH DE number 8028595 |
Statements
The quickest root-leaf interdiction problem on tree networks (English)
0 references
17 April 2025
0 references
quickest path
0 references
interdiction problem
0 references
Hamming distance
0 references
tree
0 references
0 references
0 references
