On the generation of all topological sortings
From MaRDI portal
Publication:4747520
DOI10.1016/0196-6774(83)90042-1zbMath0509.68054OpenAlexW1989817181MaRDI QIDQ4747520
Alan D. Kalvin, Yaakov L. 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
starting solutionalgorithms that generate all topological sortings of a partially ordered finite setimproved version of Wells' algorithmKnuth-Szwarchter algorithm
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms in computer science (68W99)
Related Items (9)
Generating linear extensions of posets by transpositions ⋮ Weak-order extensions of an order. ⋮ Generating permutations with given ups and downs ⋮ On extensions, linear extensions, upsets and downsets of ordered sets ⋮ Generating alternating permutations lexicographically ⋮ Bottom-up: a new algorithm to generate random linear extensions of a poset ⋮ Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures ⋮ Transposition generation of alternating permutations ⋮ On the Optimal Design of a Bipartite Matching Queueing System
This page was built for publication: On the generation of all topological sortings
