From post

A Loopless Algorithm for Generating (k, m)-ary Trees in Gray-Code Order.

, , , и . FAW, том 12340 из Lecture Notes in Computer Science, стр. 121-132. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Two Kinds of Generalized 3-Connectivities of Alternating Group Networks., , , и . FAW, том 10823 из Lecture Notes in Computer Science, стр. 3-14. Springer, (2018)A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations., , и . Theor. Comput. Sci., 355 (3): 303-314 (2006)Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms., , , и . ISCO, том 13526 из Lecture Notes in Computer Science, стр. 201-211. Springer, (2022)Three Completely Independent Spanning Trees of Crossed Cubes with Application to Secure-Protection Routing., , , и . HPCC/SmartCity/DSS, стр. 1358-1365. IEEE, (2019)Three Edge-Disjoint Hamiltonian Cycles in Crossed Cubes with Applications to Fault-Tolerant Data Broadcasting., , , и . HPCC/DSS/SmartCity/DependSys, стр. 377-383. IEEE, (2021)Constructing Independent Spanning Trees on Bubble-Sort Networks., , , и . COCOON, том 10976 из Lecture Notes in Computer Science, стр. 1-13. Springer, (2018)Amortized efficiency of generating planar paths in convex position., , , и . Theor. Comput. Sci., 412 (35): 4504-4512 (2011)A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order., , и . FAW, том 10336 из Lecture Notes in Computer Science, стр. 221-232. Springer, (2017)Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order., , , и . COCOA, том 10043 из Lecture Notes in Computer Science, стр. 505-518. Springer, (2016)Ranking and Unranking of t-Ary Trees Using RD-Sequences., , и . IEICE Trans. Inf. Syst., 94-D (2): 226-232 (2011)