Back to Search
Start Over
Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence1.
- Source :
-
Computer Journal . Jul2010, Vol. 53 Issue 6, p661-666. 6p. 3 Diagrams, 1 Chart. - Publication Year :
- 2010
-
Abstract
- An ordered tree is called a non-regular tree with a prescribed branching sequence (or non-regular tree for short) if its internal nodes have a prespecified degree sequence in preorder list. We define a concise representation, called right distance sequences to describe such trees. A coding tree helps us to systematically investigate the structural representation of non-regular trees. Consequently, we present a loopless algorithm to generate Gray-codes of non-regular trees using right distance sequences. [ABSTRACT FROM PUBLISHER]
- Subjects :
- *TREE graphs
*CODING theory
*GRAY codes
*ALGORITHMS
*GRAPH theory
Subjects
Details
- Language :
- English
- ISSN :
- 00104620
- Volume :
- 53
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Computer Journal
- Publication Type :
- Academic Journal
- Accession number :
- 51859873
- Full Text :
- https://doi.org/10.1093/comjnl/bxp015