On the generation of all topological sortings

DOI10.1016/0196-6774(83)90042-1MaRDI QIDQ4747520zbMATH OpenOpenAlexFDO

Authors Alan D. Kalvin, Yaakov Varol

Publication date 1983

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(83)90042-1

zbMATH Keywords

algorithms that generate all topological sortings of a partially ordered finite setimproved version of Wells' algorithmKnuth-Szwarchter algorithmstarting solution

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(10)

• Generating permutations with given ups and downs
• Weak-order extensions of an order.
• Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures
• Bottom-up: a new algorithm to generate random linear extensions of a poset
• Generating linear extensions of posets by transpositions
• On the optimal design of a bipartite matching queueing system
• On extensions, linear extensions, upsets and downsets of ordered sets
• Generating alternating permutations lexicographically
• Graphical methods for order-of-addition experiments
• Transposition generation of alternating permutations

This page was built for publication: On the generation of all topological sortings

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