A structured program to generate all topological sorting arrangements

DOI10.1016/0020-0190(74)90001-5zbMath0276.68026OpenAlexW2016000144MaRDI QIDQ1393277

Jayme Luiz Szwarcfiter, Donald E. Knuth

Publication date: 1974

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(74)90001-5

zbMATH Keywords

combinatorial problemsprogramming languagesdata structures

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Data structures (68P05) Algorithms in computer science (68W99)

Related Items

On some complexity properties of N-free posets and posets with bounded decomposition diameter, Generating linear extensions of posets by transpositions, Evaluating systems of equations: Toward a formal approach, Reverse search for enumeration, Dijkstra graphs, Lexicographic permutations with restrictions, Topological ordering algorithm for LDAG, A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions, Topological sorts on DAGs, On extensions, linear extensions, upsets and downsets of ordered sets, Thick 2D relations for document understanding, 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, A survey on the mathematical foundations of axiomatic entropy: representability and orderings, Transposition generation of alternating permutations

Cites Work

• Backtrack Programming
• An efficient procedure for the generation of closed subsets
• Nondeterministic Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item