An algorithm to generate all topological sorting arrangements

DOI10.1093/COMJNL/24.1.83zbMath0454.68057OpenAlexW2145498098MaRDI QIDQ3902500

Doron Rotem, Yaakov L. Varol

Publication date: 1981

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/24.1.83

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (10)

Generating linear extensions of posets by transpositions ⋮ Evolution on distributive lattices ⋮ The gold partition conjecture for 6-thin posets ⋮ Partial order bounding: A new approach to evaluation in game tree search ⋮ On extensions, linear extensions, upsets and downsets of ordered sets ⋮ Counting linear extension majority cycles in partially ordered sets on up to 13 elements ⋮ 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 ⋮ Reconstruction of Partial Orders and List Representation as Random Structures ⋮ Unnamed Item

This page was built for publication: An algorithm to generate all topological sorting arrangements