Showing papers by "Indian Institute of Management Calcutta published in 1984"
13 Dec 1984
TL;DR: A heuristic search approach to compute the optimal path between any pair of nodes in such a distributed network of De Bruijn graphs is described.
Abstract: Recently it has been shown that the general class of De Bruijn graphs can be used to develop a fault-tolerant communication architecture for distributed processing. The present paper describes a heuristic search approach to compute the optimal path between any pair of nodes in such a distributed network.
2 citations
13 Dec 1984
TL;DR: The expected MWBF of a binary tree under random insertions is derived and it is shown that an AVL tree has anMWBF of atleast 0.73, which is close to the mean weight balance factor of any binary tree.
Abstract: A new performance measure for binary trees, called the mean weight balance factor (MWBF), is introduced. For any binary tree T, 0