A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree (Q987822)
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: A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree |
scientific article; zbMATH DE number 5771260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree |
scientific article; zbMATH DE number 5771260 |
Statements
A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree (English)
0 references
16 August 2010
0 references
distance in graphs
0 references
graph algorithms
0 references
total distance
0 references
0.8028275370597839
0 references
0.7832910418510437
0 references
0.7828593850135803
0 references
0.7791011333465576
0 references
