Cool-lex order and k-ary Catalan structures

For any given k, the sequence of k-ary Catalan numbers, Ct,k=1kt+1(ktt), enumerates a number of combinatorial objects, including k-ary Dyck words of length n=kt and k-ary trees with t internal nodes. We show that these objects can be efficiently ordered using the same variation of lexicographic orde...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of discrete algorithms (Amsterdam, Netherlands) Ročník 16; s. 287 - 307
Hlavní autori:	Durocher, Stephane, Li, Pak Ching, Mondal, Debajyoti, Ruskey, Frank, Williams, Aaron
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.10.2012
Predmet:	Bubble langauges Catalan structures Cool-lex order k-ary Dyck words k-ary trees Loopless algorithms Ranking Loopless algorithms Catalan structures Ranking k-ary trees Bubble langauges Cool-lex order k-ary Dyck words
ISSN:	1570-8667, 1570-8675
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!