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

DOI10.1016/j.tcs.2012.02.008zbMath1296.68103OpenAlexW2000645132MaRDI QIDQ391390

Mohammad Hasan, H. S. Yoon

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.008

zbMATH Keywords

Hamiltonian cycleGray codeideals of a posetSquire's recurrence

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07)

Related Items (1)

Skyline groups are ideals. An efficient algorithm for enumerating skyline groups

Cites Work

• Unnamed Item
• Efficient generation of the ideals of a poset in Gray code order
• Gray codes for column-convex polyominoes and a new class of distributive lattices
• 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
• Efficient Coroutine Generation of Constrained Gray Sequences

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