Ranking and unranking algorithms for loopless generation of t-ary trees

, &
Logic Journal of the IGPL 19 (1):33-43 (2011)
  Copy   BIBTEX

Abstract

In this paper, we present two new ranking and unranking algorithms for z-sequences in Gray-code order. These algorithms are designed based on a loopless generation algorithm which is given for z-sequences corresponding to t-ary trees by Roelants van Baronaigien and Xiang et al. Up to our knowledge no other ranking and unranking algorithms are given for Gray-codes corresponding to t-ary trees. The time complexity of both algorithms for t-ary trees with n nodes is O

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/jzp097

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Finding socially best spanning trees.Andreas Darmann, Christian Klamler & Ulrich Pferschy - 2011 - Theory and Decision 70 (4):511-527.
Reversible Adaptive Trees.Yannick L. Kergosien - 2013 - Acta Biotheoretica 61 (3):413-424.
Generation of Referring Expressions: Assessing the Incremental Algorithm.Kees van Deemter, Albert Gatt, Ielka van der Sluis & Richard Power - 2012 - Cognitive Science 36 (5):799-836.
Classes of Markov-like k-ALGORITHMS.Zdzislaw Grodzki & Jerzy Mycka - 1996 - Reports on Mathematical Logic:83-99.
Track 2-Languages and Algorithms-Session 4-Algorithms-Parallelization Algorithms for Three-Body Interactions in Molecular Dynamics Simulation. [REVIEW]Jianhui Zhou Li & Richard J. Sadus - 2006 - In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer Verlag. pp. 374-382.
On the convergence of a factorized distribution algorithm with truncation selection.Qingfu Zhang - 2004 - Complexity 9 (4):17-23.
It is not evolution, but a better game would need a better agent.Christian Huyck & Ian Mitchell - 2005 - Behavioral and Brain Sciences 28 (4):499-500.
Rational Disagreements in Phylogenetics.Fabrizzio Mc Manus - 2009 - Acta Biotheoretica 57 (1-2):99-127.
Selected papers on design of algorithms.Donald Ervin Knuth - 2010 - Stanford, Calif.: Center for the Study of Language and Information.
Session 2A-Approximation Algorithms-A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees. [REVIEW]Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li & Weizhao Wang - 2006 - In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer Verlag. pp. 100-110.
On logic of complex algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.
Is there an ethics of algorithms?Martin Peterson - 2011 - Ethics and Information Technology 13 (3):251-260.
Generation of Referring Expressions: Assessing the Incremental Algorithm.Kees van Deemter, Albert Gatt, Ielka van der Sluis & Richard Power - 2012 - Cognitive Science 36 (5):799-836.
How to think about algorithms.Jeff Edmonds - 2008 - New York: Cambridge University Press.
Algorithms for computing minimal conflicts.S. Luan, L. Magnani & G. Dai - 2006 - Logic Journal of the IGPL 14 (2):391--406.

Analytics

Added to PP
2015-02-04

Downloads
3 (#1,714,622)

6 months
2 (#1,204,205)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references