Searching for "On the Generation of All Topological Sortings." – sorted by Relevance.
-
Program Analysis by Formal Transformation
- to Generate All Topological Sorting Arrangements" (Knuth and Szwarcter 1974), as a case study for the analysis
- Cited by 19 (7 self) – Add To MetaCart
-
Generating Linear Extensions of Posets by Transpositions
- -known as "topological sortings". A number of algorithms exist for generating all the topological sortings
- Cited by 16 (1 self) – Add To MetaCart
-
Generating Alternating Permutations Lexicographically
- . We present a constant average-time algorithm for generating all alternating permutations
- Cited by 1 (1 self) – Add To MetaCart

