A Gray Code of Ordered Trees

07/03/2022
by   Shin-ichi Nakano, et al.
0

A combinatorial Gray code for a set of combinatorial objects is a sequence of all combinatorial objects in the set so that each object is derived from the preceding object by changing a small part. In this paper we design a Gray code for ordered trees with n vertices such that each ordered tree is derived from the preceding ordered tree by removing a leaf then appending a leaf elsewhere. Thus the change is just remove-and-append a leaf, which is the minimum.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2020

An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time

Trees are useful entities allowing to model data structures and hierarch...
research
10/12/2020

Growth of Random Trees by Leaf Attachment

We study the growth of a time-ordered rooted tree by probabilistic attac...
research
02/02/2022

Combinatorial Gray codes-an updated survey

A combinatorial Gray code for a class of objects is a listing that conta...
research
06/06/2019

How to make a pizza: Learning a compositional layer-based GAN model

A food recipe is an ordered set of instructions for preparing a particul...
research
04/08/2020

On recursively defined combinatorial classes and labelled trees

We define and prove isomorphisms between three combinatorial classes inv...
research
05/25/2018

Certified Ordered Completion

On the one hand, ordered completion is a fundamental technique in equati...
research
12/22/2021

An algorithm for generating random mixed-arity trees

Inspired by [4] we present a new algorithm for uniformly random generati...

Please sign up or login with your details

Forgot password? Click here to reset