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

DOI10.1016/j.ipl.2009.03.005zbMath1197.68056OpenAlexW2102921272MaRDI QIDQ989454

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

algorithmsposetHamiltonian cycleGray code

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• An algorithm to generate the ideals of a partial order
• Gray codes from antimatroids
• 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
• Unnamed Item

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