CONSTANT TIME GENERATION OF FREE TREES.

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

doi:10.1137/0215039

CONSTANT TIME GENERATION OF FREE TREES.

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

Mathematics

Research output: Contribution to journal › Article › peer-review

65 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 language	English (US)
Pages (from-to)	540-548
Number of pages	9
Journal	SIAM Journal on Computing
Volume	15
Issue number	2
DOIs	https://doi.org/10.1137/0215039
State	Published - 1986

Access

10.1137/0215039

OpenUrl availability

Full text

Cite this

@article{e1345d1af0ba4ba09b10d8be0a519e42,

title = "CONSTANT TIME GENERATION OF FREE TREES.",

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.",

author = "Wright, {Robert Alan} and Bruce Richmond and Andrew Odlyzko and Mckay, {Brendan D.}",

year = "1986",

doi = "10.1137/0215039",

language = "English (US)",

volume = "15",

pages = "540--548",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - CONSTANT TIME GENERATION OF FREE TREES.

AU - Wright, Robert Alan

AU - Richmond, Bruce

AU - Odlyzko, Andrew

AU - Mckay, Brendan D.

PY - 1986

Y1 - 1986

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022709539&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022709539&partnerID=8YFLogxK

U2 - 10.1137/0215039

DO - 10.1137/0215039

M3 - Article

AN - SCOPUS:0022709539

SN - 0097-5397

VL - 15

SP - 540

EP - 548

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -

CONSTANT TIME GENERATION OF FREE TREES.

Abstract

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this