Algorithmic combinatorics based on slicing posets (Q2503297): Difference between revisions

Digraphs have (quasi)-order ideals defined on them analogously to posets. Using the containment of sets order they generate distributive lattices. Using these lattices structures \(L\) may be modeled for which sublattices correspond to specialized substructures \(L_B\) themselves order ideals of digraphs obtained from the original digraphs by adding edges. Counting the order ideals of these derived digraphs provides the count of the set of specialized substructures. Examples of certain standard types of combinatorial problems of some generality and importance are provided. The edge adding can be accomplished in a mechanical and efficient method via an algorithm provided in this very useful paper.