Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence

An ordered tree with specified degree sequence and n internal nodes has ai nodes of degree i, where a0=1+∑i=1(i−1)ai and n=∑i=0ai. This paper presents the first loopless algorithm for generating all ordered trees with specified degree sequence. It uses a new version of the algorithm for generating m...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of algorithms 2000-02, Vol.34 (2), p.309-336
Hauptverfasser:	Korsh, James F., LaFollette, Paul
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Combinatorics. Ordered structures Exact sciences and technology Graph theory Mathematics Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	An ordered tree with specified degree sequence and n internal nodes has ai nodes of degree i, where a0=1+∑i=1(i−1)ai and n=∑i=0ai. This paper presents the first loopless algorithm for generating all ordered trees with specified degree sequence. It uses a new version of the algorithm for generating multiset permutations. When ak=N, a0=(k−1)N+1, and all other ai's are 0, all N node k-ary trees are generated.
ISSN:	0196-6774 1090-2678
DOI:	10.1006/jagm.1999.1059