On O(1) Time Algorithms for Combinatorial Generation

DOI10.1093/comjnl/44.4.292zbMath0988.68222OpenAlexW1993527186MaRDI QIDQ2765228

Limin Xiang, Kazuo Ushijima

Publication date: 9 April 2002

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/44.4.292

zbMATH Keywords

strong minimal change property

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items (5)

A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ Constant time generation of derangements ⋮ Listing combinatorial objects in parallel ⋮ FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously

This page was built for publication: On O(1) Time Algorithms for Combinatorial Generation