O(1) Time Algorithms for Combinatorial Generation by Tree Traversal

DOI10.1093/COMJNL/42.5.400zbMath0944.68529OpenAlexW2144710417MaRDI QIDQ4935301

Tadao Takaoka

Publication date: 10 April 2000

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

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items (2)

A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously

This page was built for publication: O(1) Time Algorithms for Combinatorial Generation by Tree Traversal