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

DOI10.1016/J.IPL.2009.03.005zbMATH Open1197.68056OpenAlexW2102921272MaRDI QIDQ989454FDOQ989454

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

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

zbMATH Keywords

algorithmsHamiltonian cycleGray codeposet

Mathematics Subject Classification ID

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

Cites Work

• A Gray Code for the Ideals of a Forest Poset
• Calculating bounds on reachability and connectedness in stochastic networks
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• An algorithm to generate the ideals of a partial order
• Gray codes from antimatroids
• Title not available (Why is that?)

Cited In (5)

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

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)