Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees in B-Order
Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang
Journal of Combinatorial Optimization, Vol. 44, No. 3, (2022) pp. 1495-1510.

The above article has been cited by the articles listed below.
  1. Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery, Closure and nonclosure properties of the classes of compressible and rankable sets, Journal of Computer and System Sciences 120 (2021) 162-176.

  2. Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang, A loopless algorithm for generating (k,m)-ary trees in Gray code order, Optimization Letters 15(4) (2021) 1133-1154. (*)

Times cited: 1 (from Web of Science)