𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The optimal ordering of nodes of an oriented tree

✍ Scribed by M. A. Sheidvasser

Publisher
Springer US
Year
1974
Tongue
English
Weight
519 KB
Volume
8
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The optimal ordering of tree networks
The optimal ordering of tree networks
✍ G.C. Everstine; E.H. Cuthill πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 212 KB
On the number of deepest nodes in ordere
On the number of deepest nodes in ordered trees
✍ R. Kemp πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 637 KB

Let Qn.k,, be the number of all n-node ordered trees with r nodes of maximum level k and let B,,\*,, be the number of all r-tuply rooted ordered trees with n nodes and height less than or equal to k. In this paper we derive the identitity where n, k, r > 0. An explicit expression for Qn,k,r and its

On the width of an orientation of a tree
On the width of an orientation of a tree
✍ M. D. Atkinson; D. T. H. Ng πŸ“‚ Article πŸ“… 1988 πŸ› Springer Netherlands 🌐 English βš– 641 KB

There are 2"-t ways in which a tree on n vertices can be oriented. Each of these can be regarded as the (Hasse) diagram of a partially ordered set. The maximal and minimal widths of these posets are determined. The maximal width depends on the bipartition of the tree as a bipartite graph and it can