Author:
Felsner Stefan,Manneville Thibault
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference16 articles.
1. Atkinson, A., Chang, H.: Extensions of partial orders of bounded width. Congressus Numerantium 52, 21–35 (1985)
2. Atkinson, M.: On computing the number of linear extensions of a tree. Order 7, 23–25 (1990)
3. Bandlow, J.: An elementary proof of the hook formula. Electron. J. Combin. 15, 14 (2008)
4. Brightwell, G., Winkler, P.: Counting linear extensions is #P-complete. In: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, STOC ’91, pp. 175–181. ACM, New York (1991)
5. Grillet, P.: Maximal chains and antichains. Fundamenta Mathematicae 65, 157–167 (1969)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献