On the complexity of rooted trees and hierarchies with possible applications to organization design and system architectures
Document Type
Article
Publication Date
3-1-2006
Abstract
We introduce a complexity function over all rooted trees (that is, Tree Hierarchies). The purpose of this paper is to minimize this function, over all rooted trees on a fixed number of vertices. The results will be useful in the study of organization design and system architectures.
Publication Source (Journal or Book title)
WSEAS Transactions on Systems
First Page
625
Last Page
630
Recommended Citation
Chen, P., & Ding, G. (2006). On the complexity of rooted trees and hierarchies with possible applications to organization design and system architectures. WSEAS Transactions on Systems, 5 (3), 625-630. Retrieved from https://repository.lsu.edu/mathematics_pubs/413
COinS