CONSTANT TIME GENERATION OF FREE TREES.

Robert Alan Wright, Bruce Richmond, Andrew Odlyzko, Brendan D. Mckay

Research output: Contribution to journalArticlepeer-review

52 Scopus citations

Abstract

An algorithm of T. Beyer and S. M. Hedetniemi for generating rooted unlabeled trees is extended to generate unlabeled free trees. All the nonisomorphic trees of a given size are generated, without repetition, in time proportional to the number of trees.

Original languageEnglish (US)
Pages (from-to)540-548
Number of pages9
JournalSIAM Journal on Computing
Volume15
Issue number2
DOIs
StatePublished - 1986

Fingerprint Dive into the research topics of 'CONSTANT TIME GENERATION OF FREE TREES.'. Together they form a unique fingerprint.

Cite this