Efficient generation of the ideals of a poset in Gray code order

DOI10.1016/J.IPL.2009.03.005MaRDI QIDQ989454zbMATH OpenOpenAlexFDO

Authors J. Martínez

Publication date 20 August 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.archipel.uqam.ca/2849/1/D1905.pdf

zbMATH Keywords

algorithmsHamiltonian cycleGray codeposet

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics in computer science (68R05)

Recommendations

• Efficient generation of the ideals of a poset in Gray code order. II
• A Gray Code for the Ideals of a Forest Poset
• Gray codes, loopless algorithm and partitions
• Gray Codes for the Ideals of Interval Orders
• Producing all ideals of a forest, functionally

Cites work

• scientific article; zbMATH DE number 3648418 (Why is no real title available?)
• A Gray Code for the Ideals of a Forest Poset
• An algorithm to generate the ideals of a partial order
• Calculating bounds on reachability and connectedness in stochastic networks
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Gray codes from antimatroids

Cited in

(5)

• Gray Codes for the Ideals of Interval Orders
• Efficient generation of the ideals of a poset in Gray code order. II
• A Gray Code for the Ideals of a Forest Poset
• Producing all ideals of a forest, functionally
• A general exhaustive generation algorithm for Gray structures

This page was built for publication: Efficient generation of the ideals of a poset in Gray code order

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