On computing the number of linear extensions of a tree
On computing the number of linear extensions of a tree
复制标题
关于计算树的线性扩展数
作者：
M. Atkinson
给出了计算覆盖图为树的偏序集的线性扩张数的算法，该算法需要O（n*）的算术运算。
An algorithm requiring O (n*) arithmetic operations for computing the number of linear extensions of a poset whose covering graph is a tree is given.