An algorithm to generate all topological sorting arrangements

DOI10.1093/COMJNL/24.1.83MaRDI QIDQ3902500zbMATH OpenOpenAlexFDO

Authors Doron Rotem, Yaakov 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)

Cited in

(11)

• Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures
• Evolution on distributive lattices
• Bottom-up: a new algorithm to generate random linear extensions of a poset
• Generating linear extensions of posets by transpositions
• Reconstruction of partial orders and list representation as random structures
• Cycle-free cuts of mutual rank probability relations.
• On extensions, linear extensions, upsets and downsets of ordered sets
• Partial order bounding: A new approach to evaluation in game tree search
• Combinatorial generation via permutation languages. IV: Elimination trees
• The gold partition conjecture for 6-thin posets
• Counting linear extension majority cycles in partially ordered sets on up to 13 elements

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

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