A note on the complexity of rooted trees and hierarchies with possible applications to organization design and system architectures

Authors:
Peter P. Chen;Guoli Ding
Affiliations:
Department of Computer Science, Louisiana State University, Louisiana;Department of Mathematics, Louisiana State University, Louisiana
Venue:
MATH'05 Proceedings of the 8th WSEAS International Conference on Applied Mathematics
Year:
2005

Citing 3
Cited 0

The entity-relationship model—toward a unified view of data

ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Generating r-regular graphs

Discrete Applied Mathematics
The best expert versus the smartest algorithm

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a complexity function over all rooted trees (i.e., Tree Hierarchies). The purpose of this note is to minimize this function, over all rooted trees on a fixed number of vertices. The results may be useful in the study of organization design and system architectures.