Counting, Ranking, and Randomly Generating CP-nets∗
Thomas E. Allen, Judy Goldsmith, Nicholas Mattei · 2016
We introduce a method for generating CP-nets uniformly at random. As CP-nets encode a subset of partial orders, en-suring that we generate samples uniformly at random is not a trivial task. We present algorithms for counting CP-nets, ranking and computing the rank of an arbitrary CP-net for a given number of nodes, and generating a CP-net given its rank. We also show how to generate all CP-nets with a given number of nodes.