An improved algorithm for finding a length-constrained maximum-density subtree in a tree (Q975556)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved algorithm for finding a length-constrained maximum-density subtree in a tree |
scientific article |
Statements
An improved algorithm for finding a length-constrained maximum-density subtree in a tree (English)
0 references
9 June 2010
0 references
algorithms
0 references
dynamic programming
0 references
trees
0 references
network design
0 references
divide and conquer
0 references
0 references
0 references
