An improved algorithm for finding a length-constrained maximum-density subtree in a tree (Q975556)
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: An improved algorithm for finding a length-constrained maximum-density subtree in a tree |
scientific article; zbMATH DE number 5719259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm for finding a length-constrained maximum-density subtree in a tree |
scientific article; zbMATH DE number 5719259 |
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
0 references
0.90465283
0 references
0 references
0.9008691
0 references
0.8950321
0 references
0.8923468
0 references
0.89197505
0 references
0.88564336
0 references
0.88547075
0 references
