Linear Extensions of N-free Orders
Combinatorics
2017-06-16 v1
Abstract
We consider the number of linear extensions of an N-free order P. We give upper and lower bounds on this number in terms of parameters of the corresponding arc diagram. We propose a dynamic programming algorithm to calculate the number. The algorithm is polynomial if a new parameter called activity is bounded by a constant. The activity can be bounded in terms of parameters of the arc diagram.
Cite
@article{arxiv.1311.1612,
title = {Linear Extensions of N-free Orders},
author = {Stefan Felsner and Thibault Manneville},
journal= {arXiv preprint arXiv:1311.1612},
year = {2017}
}
Comments
11 pages, 4 figures