Algorithmic combinatorics based on slicing posets (Q2503297): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q233347 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Joseph Neggers / rank | |||
Normal rank |
Revision as of 10:18, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithmic combinatorics based on slicing posets |
scientific article |
Statements
Algorithmic combinatorics based on slicing posets (English)
0 references
14 September 2006
0 references
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.
0 references
Birkhoff's theorem
0 references
distributive lattices
0 references
order ideals of digraphs
0 references
algorithm
0 references