|
|||||
|
|
On computing the number of linear extensions of a tree |
|
| Authors: | M. D. Atkinson |
| Affiliation: | (1) School of Computer Science, Carleton University, K1S 5B6 Ottawa, Canada |
| Abstract: | An algorithm requiring O(n2) arithmetic operations for computing the number of linear extensions of a poset whose covering graph is a tree is given.This research was partially funded by the National Science and Engineering Research Council of Canada under Grant Number A4219. |
| Keywords: | 06A05 68C05 |
| 本文献已被 SpringerLink 等数据库收录！ | |