Given a Hasse Diagram of a poset, how can we determine all maximal chains? Is there any tried-and-tested algorithm to efficiently compute the answer? This question deals with the specific case where a set is ordered by the divisibility relation. But how are we to determine the maximal chains of any poset given it's Hasse Diagram?
Any help is appreciated!