Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Er:1985:EOT,
author = "M. C. Er",
title = "Enumerating Ordered Trees Lexicographically",
journal = j-COMP-J,
volume = "28",
number = "5",
pages = "538--542",
month = nov,
year = "1985",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/28.5.538",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:19 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/28/5.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/",
URL = "http://comjnl.oxfordjournals.org/content/28/5/538.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/538.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/539.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/540.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/541.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/542.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Western Australia, Dep of Computer Science,
Nedlands, Aust",
affiliationaddress = "Univ of Western Australia, Dep of Computer
Science, Nedlands, Aust",
classcodes = "C1160 (Combinatorial mathematics)",
classification = "723; 921",
corpsource = "Dept. of Comput. Sci., Western Australia Univ.,
Nedlands, WA, Australia",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computer programming --- Algorithms; enumerating;
feasible binary bit-; lexicographic enumeration;
lexicographically; mathematical techniques; ordered
trees; patterns; ranking; Trees; trees (mathematics);
unranking",
treatment = "T Theoretical or Mathematical",
}
Related entries
- binary,
23(3)248,
23(3)269,
23(4)332,
24(1)42,
25(1)140,
25(1)158,
25(3)316,
25(4)471,
26(2)106,
26(2)154,
26(2)187,
26(3)193,
27(2)178,
28(4)417,
28(4)426,
29(1)36,
29(2)103,
29(2)171,
29(4)368,
30(2)176,
30(4)308,
30(6)541,
30(6)565,
31(2)141,
31(4)330,
31(6)564,
31(6)565,
32(1)45,
32(1)63,
32(1)68,
32(1)76,
32(3)246,
32(5)470
- enumerating,
29(2)171,
30(5)433
- enumeration,
31(1)65
- Er, M. C.,
25(1)93,
25(3)397,
25(4)442,
26(3)205,
26(3)224,
26(4)293,
27(1)80,
27(2)171,
27(3)278,
27(3)285,
28(5)543,
29(5)430,
30(3)282,
30(3)282-1,
30(6)569,
31(1)61,
31(3)283,
31(6)557,
32(1)76,
32(5)470
- feasible,
25(2)199,
28(1)89,
31(1)61
- lexicographic,
23(4)332,
26(1)92,
26(3)205,
27(4)373,
28(4)444,
30(3)282,
30(3)282-1,
30(6)569,
31(1)61,
31(1)65
- lexicographically,
26(3)205,
29(2)171
- mathematical,
24(2)177,
24(2)180,
24(2)184,
25(1)7,
25(1)56,
25(4)478,
26(1)6,
26(2)97,
26(2)106,
26(3)193,
27(2)165,
27(4)368-1,
28(1)5,
28(1)78,
28(1)89,
28(2)142,
28(2)179,
28(4)414,
28(4)417,
28(4)426,
28(5)498,
28(5)524,
28(5)530,
29(1)36,
29(1)52,
29(2)171,
29(2)176,
29(2)182,
29(4)378,
29(5)416,
29(6)553,
30(1)16,
30(1)20,
30(1)70,
30(2)128,
30(2)189,
30(3)258,
30(3)268,
30(3)282,
30(4)298,
30(5)458,
30(6)498,
30(6)569,
31(1)61,
31(1)71,
31(1)76,
31(2)155,
31(3)229,
31(3)243,
31(3)283,
31(4)364,
31(6)490,
31(6)545,
31(6)557,
31(6)564,
31(6)567,
32(1)45,
32(1)68,
32(1)76,
32(1)86,
32(1)93,
32(2)175,
32(4)351,
32(4)374,
32(4)377
- mathematics,
23(2)161,
23(3)248,
23(3)256,
23(4)332,
25(1)158,
25(2)235,
25(2)239,
25(2)257,
26(2)97,
26(2)106,
26(2)188,
26(3)193,
26(3)205,
26(3)224,
27(2)178,
27(2)184,
27(3)218,
27(3)225,
27(4)368-1,
28(1)73,
28(2)105,
28(3)313,
28(4)417,
28(4)426,
28(4)433,
28(4)439,
29(1)36,
29(1)52,
29(1)76,
29(2)171,
29(2)176,
29(6)564,
30(3)268,
30(3)277,
30(3)282,
30(4)355,
30(5)433,
30(6)569,
31(1)61,
31(1)65,
31(3)269,
31(4)330,
31(4)353,
31(4)364,
31(6)557,
31(6)564,
31(6)567,
32(1)68,
32(1)76,
32(3)281,
32(4)374,
32(5)470,
32(5)474,
32(6)571
- ordered,
23(2)161,
26(3)205,
30(6)487,
30(6)565,
31(6)564,
32(1)76
- pattern,
23(1)46,
24(3)263,
25(1)37,
25(1)116,
25(1)130,
26(4)375,
27(4)362,
28(1)82,
28(3)264,
28(4)409,
30(4)349,
30(5)420,
31(4)344,
32(2)122,
32(2)127,
32(4)351,
32(6)549
- ranking,
29(2)171,
30(6)569
- unranking,
29(2)171