A loop-free algorithm for generating the linear extensions of a poset
type: Item
instance of: scholarly article
title: A loop-free algorithm for generating the linear extensions of a poset
zbMATH Open document ID: 0849.06003
DOI: 10.1007/BF01108590
author: E. Rodney Canfield
author: S. Gill Williamson
published in: Order
publication date: 1996-11-04T00:00:00Z
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 898023
zbMATH Keywords: linear extension
zbMATH Keywords: \(\#P\)-complete
zbMATH Keywords: loop-free algorithm
zbMATH Keywords: poset-extension
MaRDI profile type: Publication
cites work: Q4091421
cites work: Counting linear extensions
cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
cites work: Q5672651
cites work: Q3862379
cites work: Combinatorial Gray Codes
cites work: Generation of Permutations by Adjacent Transposition
cites work: On the translation of languages from left to right
cites work: A Gray Code for the Ideals of a Forest Poset
cites work: Generating Linear Extensions Fast
cites work: The complexity of computing the permanent
cites work: A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
cites work: Q4552272
description: scientific article; zbMATH DE number 898023