A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order

DOI10.1007/978-3-030-59901-0_11OpenAlexW3090135189MaRDI QIDQ2037975

Ro-Yu Wu, Jou-Ming Chang, Yu-Hsuan Chang, Cheng-Kuan Lin

Publication date: 8 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-59901-0_11

zbMATH Keywords

amortized analysisloopless algorithms\((k, m)\)-ary treesgray-codesZaks' sequences

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms

This page was built for publication: A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order