Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312)
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: Weight-constrained and density-constrained paths in a tree: enumerating, counting, and k-maximum density paths |
scientific article; zbMATH DE number 6375314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths |
scientific article; zbMATH DE number 6375314 |
Statements
Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (English)
0 references
28 November 2014
0 references
counting mode
0 references
design and analysis of algorithms
0 references
feasible paths
0 references
\(k\)-maximum density path problem
0 references
network design
0 references
trees
0 references
0 references
0 references
0 references
0.8595411777496338
0 references
0.8576257824897766
0 references
0.8572603464126587
0 references
0.80401211977005
0 references
0.781916081905365
0 references
