I want to compute the partial order width i.e. the size of the maximum antichain in a given partial order.
By Dilworth's Theorem this is the same as minimal chains required to decompose the graph, but I cannot find any algorithms to compute any of these equivalent quantities.
