Efficiently counting representations of finite posets

MaRDI QIDQ5447845zbMATH OpenFDO

Authors

Publication date 20 March 2008

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Partial orders, general (06A06) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 4035884
• An Algorithm for the Determination of the Variance of a Partially Ordered Set
• scientific article; zbMATH DE number 1156638
• scientific article; zbMATH DE number 1254201
• New results from an algorithm for counting posets

Cited in

(8)

• Counting two-dimensional posets
• Parity representations of posets
• Representation functions and the Neggers-Stanley condition for weight-shaped-posets
• Counting common representatives and symmetric chain decompositions
• scientific article; zbMATH DE number 4035884 (Why is no real title available?)
• scientific article; zbMATH DE number 139640 (Why is no real title available?)
• An Algorithm for the Determination of the Variance of a Partially Ordered Set
• Efficient Enumeration of Distinct Factors Using Package Representations

This page was built for publication: Efficiently counting representations of finite posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5447845)