Fast Generation of Unlabelled Free Trees using Weight Sequences

by   Paul Brown, et al.

In this paper, we introduce a new representation for ordered trees, the weight sequence representation. We then use this to construct new representations for both rooted trees and free trees, namely the canonical weight sequence representation. We construct algorithms for generating the weight sequence representations for all rooted and free trees of order n, and then add a number of modifications to improve the efficiency of the algorithms. Python implementations of the algorithms incorporate further improvements by using generators to avoid having to store the long lists of trees returned by the recursive calls, as well as caching the lists for rooted trees of small order, thereby eliminating many of the recursive calls. We further show how the algorithm can be modifed to generate adjacency list and adjacency matrix representations for free trees. We compared the run-times of our Python implementation for generating free trees with the Python implementation of the well-known WROM algorithm taken from NetworkX. The implementation of our algorithm is over four times as fast as the implementation of the WROM algorithm. The run-times for generating adjacency lists and matrices are somewhat longer than those for weight sequences, but are still over three times as fast as the corresponding implementations of the WROM algorithm.


page 1

page 2

page 3

page 4


Lock-Free Transactional Adjacency List

Adjacency lists are frequently used in graphing or map based application...

Fast algorithms for solving the Hamilton Cycle problem with high probability

We study the Hamilton cycle problem with input a random graph G=G(n,p) i...

Learning Highly Recursive Input Grammars

This paper presents Arvada, an algorithm for learning context-free gramm...

A Breakdown Free Numerical Algorithm for Inverting General Tridiagonal Matrices

In the current paper the authors linked two methods in order to evaluate...

Arbitrary-length analogs to de Bruijn sequences

Let α be a length-L cyclic sequence of characters from a size-K alphabet...

An algorithm for generating random mixed-arity trees

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

Experimental Comparison of PC-Trees and PQ-Trees

PQ-trees and PC-trees are data structures that represent sets of linear ...

Please sign up or login with your details

Forgot password? Click here to reset