Asymptotic Enumeration of Convex Polygons

Journal of Combinatorial Theory, Series A - Tập 80 - Trang 196-217 - 1997
Dudley Stark1, Nicholas C. Wormald1
1Department of Mathematics, University of Melbourne, Parkville, Victoria 3052, Australia

Tài liệu tham khảo

M. Abramowitz, I. A. Stegun, 1985, Handbook of Mathematical Functions, Dover, New York Bousquet-Mélou, 1996, Res. Rep., 1132-96 Bollobás, 1985 Delest, 1984, Algebraic languages and polyominoes enumeration, Theoret. Comput. Sci., 34, 169, 10.1016/0304-3975(84)90116-6 Enting, 1992, Enumeration of almost convex polygons on the square lattice, Random Structures and Algorithms, 3, 445, 10.1002/rsa.3240030407 Odlyzko, 1993, Asymptotic enumeration methods Wormald, 1996, The perturbation method and triangle-free random graphs, Random Structures and Algorithms, 9, 253, 10.1002/(SICI)1098-2418(199608/09)9:1/2<253::AID-RSA15>3.0.CO;2-O