Add to ORKGAbstract: 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. Key-Words: tree complexity, hierarchy complexity, rooted tree, k-ary tree, complete k-ary tree, near-complete k-ary tree, organization design, and system architecture. 1
The mathematical formulation of the decomposition problem is the aim of the paper as well as the inv...
Many application areas represent the architecture of complex systems by means of hierarchical graphs...
AbstractWe generalize tree-decompositions to decompositions modelled on graphs other than trees, and...
Abstract: We define a complexity function over all rooted trees (i.e., Tree Hierarchies). The purpos...
We introduce a complexity function over all rooted trees (that is, Tree Hierarchies). The purpose of...
This paper proposes a model of adding relations between members of the same level in a pyramid organ...
We display a complexity notion based on the syntax of a tree series which yields two distinct hierar...
We consider the problem of laying out a tree or trie in a hierarchical memory, where the tree/trie h...
The article surveys recent results in the study of topological complexity of recognizable tree langu...
SIGLETIB: RN 3147 (84) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
AbstractWe study that over a certain type of trees (e.g., all trees or all binary trees) with a give...
Within the framework of generalized combinatorial approaches, complexity is determined as a disorder...
Cicalese F, Jacobs T, Laber ES, Molinaro M. On the Complexity of Searching in Trees: Average-case Mi...
In this work we count the number of structures resulting from the application of different kinds of ...
We introduce several new models and methods for improving access to organized information. The first...
The mathematical formulation of the decomposition problem is the aim of the paper as well as the inv...
Many application areas represent the architecture of complex systems by means of hierarchical graphs...
AbstractWe generalize tree-decompositions to decompositions modelled on graphs other than trees, and...
Abstract: We define a complexity function over all rooted trees (i.e., Tree Hierarchies). The purpos...
We introduce a complexity function over all rooted trees (that is, Tree Hierarchies). The purpose of...
This paper proposes a model of adding relations between members of the same level in a pyramid organ...
We display a complexity notion based on the syntax of a tree series which yields two distinct hierar...
We consider the problem of laying out a tree or trie in a hierarchical memory, where the tree/trie h...
The article surveys recent results in the study of topological complexity of recognizable tree langu...
SIGLETIB: RN 3147 (84) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
AbstractWe study that over a certain type of trees (e.g., all trees or all binary trees) with a give...
Within the framework of generalized combinatorial approaches, complexity is determined as a disorder...
Cicalese F, Jacobs T, Laber ES, Molinaro M. On the Complexity of Searching in Trees: Average-case Mi...
In this work we count the number of structures resulting from the application of different kinds of ...
We introduce several new models and methods for improving access to organized information. The first...
The mathematical formulation of the decomposition problem is the aim of the paper as well as the inv...
Many application areas represent the architecture of complex systems by means of hierarchical graphs...
AbstractWe generalize tree-decompositions to decompositions modelled on graphs other than trees, and...