A loop-free algorithm for generating the linear extensions of a poset (Q1917670): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting linear extensions
@@ Property / cites work: Counting linear extensions / rank @@
+Normal rank
@@ Property / cites work @@
+Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
+Normal rank
@@ Property / cites work @@
+Q5672651
@@ Property / cites work: Q5672651 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Gray Codes
@@ Property / cites work: Combinatorial Gray Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Generation of Permutations by Adjacent Transposition
+Normal rank
@@ Property / cites work @@
+On the translation of languages from left to right
+Normal rank
@@ Property / cites work @@
+A Gray Code for the Ideals of a Forest Poset
@@ Property / cites work: A Gray Code for the Ideals of a Forest Poset / rank @@
+Normal rank
@@ Property / cites work @@
+Generating Linear Extensions Fast
@@ Property / cites work: Generating Linear Extensions Fast / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
+Normal rank
@@ Property / cites work @@
+Q4552272
@@ Property / cites work: Q4552272 / rank @@
+Normal rank