Skip Navigation

The Computer Journal 1996 39(1):36-44; doi:10.1093/comjnl/39.1.36
© 1996 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Sekharan, C. N.
Right arrow Articles by Rathi, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

START RESPONSE

Space-Time Trade-offs in the Relative Unranking of Binary Trees

C. N. Sekharan *, J. G. Del Greco * and S. Rathi *

Department of Mathematical and Computer Sciences, Loyola University Chicago, Chicago, IL 60626, USA

The set of binary trees with n internal vertices can be totally ordered using a number of different representations. There are Cn binary trees in any such order where Cn denotes the nth Catalan number. Given a total order on the set of binary trees with n internal vertices and an integer i, 1 <= i <= Cn, the unranking problem is to generate the binary tree whose ordinal number is i. Given a binary tree with T with ordinal number j < Cn and an integer i, 1 <= i <= Cn - j, a slight generalization of the unranking problem, called the relative unranking problem, is to find the binary tree with ordinal number i relative to T. The relative unranking problem is motivated by its application to computing a Steiner minimal tree in parallel. In this paper, a computationally efficient algorithm for solving the relative unranking problem is presented. The algorithm is based on a certain directed graph, called the feasible suffix graph, whose combinatorial properties are of independent interest. One of the salient features of the algorithm is that the unranking time can be traded for space. Computational experience with the algorithm is reported.

Received June 13, 1995. accepted November 17, 1995.

* Department of Mathematical and Computer Sciences, Loyola University Chicago, Chicago, IL 60626, USA Email: jdg{at}math.luc.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.