𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel realization of permutations over trees

✍ Scribed by Maurice Tchuente

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
391 KB
Volume
39
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let G = (X, E) be a finite connected (undirected) graph; a permutation (T over X is said to tie compatible with G when every vertex x different from U(X) is adjacent to U(X); 1(G) denotes the minimum k such that every permutation over X can be decomposed into a product of k permutations compatible with G. It is shown that, among all trees with X as set of vertices, tihe chain has the smallest I(G).

πŸ“œ SIMILAR VOLUMES

The representation of permutations by tr
The representation of permutations by trees
✍ P. Bhattacharya πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 361 KB

Representation of permutations and combinations of N elements in lexicographical order by elements of a tree are considered. An algorithm for generating the nodes is presented and some examples are given. The algorithm could be implemented in any programming language that allows for recursive calls.

Parallel realizations of Kanerva's spars
Parallel realizations of Kanerva's sparse distributed memory on a tree-shaped computer
✍ HΓ€mΓ€lΓ€inen, Timo; Klapuri, Harri; Saarinen, Jukka; Kaski, Kimmo πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 311 KB πŸ‘ 3 views

This paper presents two parallel realizations of sparse distributed memory (SDM) on a treeshaped computer. The original model of SDM is introduced in terms of generalized computer memory and artificial neural networks (ANNs). For parallellization purposes, addressing, storage and retrieval operation

Convex tree realizations of partitions
Convex tree realizations of partitions
✍ Andreas Dress; Michael Steel πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 326 KB