A structured program to generate all topological sorting arrangements

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

Donald E. Knuth, Jayme Luiz Szwarcfiter

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 problems; programming languages; data structures

Mathematics Subject Classification ID

68P10: Searching and sorting

68R05: Combinatorics in computer science

68P05: Data structures

68W99: Algorithms in computer science

Related Items

Topological ordering algorithm for LDAG, On extensions, linear extensions, upsets and downsets of ordered sets, Thick 2D relations for document understanding, A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions, Transposition generation of alternating permutations, On some complexity properties of N-free posets and posets with bounded decomposition diameter, Lexicographic permutations with restrictions, Evaluating systems of equations: Toward a formal approach, Reverse search for enumeration, Generating linear extensions of posets by transpositions

Cites Work

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