MINIMAL ENUMERATIONS OF ROOTED DIRECTED TREES WITH AN ACCENTUATED VERTEX |
| 5 | |
| 2012 |
| 519.1 | |||
| 171-178 |
| The vertex enumeration problem is considered of a single-rooted directed tree to minimize the sum of the accentuated vertex number and the average distance between the numbers of all pairs of adjacent vertices. An algorithm of the problem solution with complexity O( n log n ) is presented. |
 |