Generating all forest extensions of a partially ordered set

DOI10.1007/3-540-44849-7_19MaRDI QIDQ4437503zbMATH OpenFDO

Authors Jayme L. Szwarcfiter

Publication date 2 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530132.htm

zbMATH Keywords

algorithmsforestsforests extensionspartially ordered sets

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• On the generation of extensions of a partially ordered set
• On extensions, linear extensions, upsets and downsets of ordered sets (extended abstract)
• Generating Linear Extensions Fast
• Fundamentals of Computation Theory
• On extensions, linear extensions, upsets and downsets of ordered sets

Cited in

(4)

• An algorithm to generate the ideals of a partial order
• Generating linear extensions by adjacent transpositions
• scientific article; zbMATH DE number 1935512 (Why is no real title available?)
• On the generation of extensions of a partially ordered set

This page was built for publication: Generating all forest extensions of a partially ordered set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437503)