Loopless generation of linear extensions of a poset

DOI10.1023/A:1016548222238MaRDI QIDQ698444zbMATH OpenFDO

Authors James F. Korsh, Paul S. jun. LaFollette

Publication date 18 September 2002

Published in Order (Search for Journal in Brave)

zbMATH Keywords

topological sortloopless algorithmlinear extensions of a poset

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Total orders (06A05) Software, source code, etc. for problems pertaining to ordered structures (06-04)

Recommendations

• Generating Linear Extensions Fast
• scientific article; zbMATH DE number 16221
• A loop-free algorithm for generating the linear extensions of a poset
• On the random generation and counting of weak order extensions of a poset with given class cardinalities
• Fundamentals of Computation Theory

Cited in

(12)

• Generating the Linear Extensions of Certain Posets by Transpositions
• Complexity reduction and approximation of multidomain systems of partially ordered data
• Linear extensions of infinite posets
• Bottom-up: a new algorithm to generate random linear extensions of a poset
• Generating Gray codes for weak orders in constant amortized time
• Fundamentals of Computation Theory
• Generating all linear orthomorphisms without repetition
• scientific article; zbMATH DE number 65462 (Why is no real title available?)
• Mining posets from linear orders.
• A loopless algorithm for generation of basic minimal interval orders
• Binary bubble languages and cool-lex order
• Constant time generation of derangements

This page was built for publication: Loopless generation of linear extensions of a poset

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