Modification of the algorithm development method for combinatorial generation based on the application of the generating functions theory
DOI: 10.21293/1818-0442-2019-22-3-55-60
Abstract: In this article, a modification of the method for developing algorithms for combinatorial generation on the basis of and-or trees is presented. In contrast to the original version of the method, the proposed modification uses the method aimed at obtaining explicit expressions for the coefficients of generating functions. This method is applied to find an expression of the cardinality function of a combinatorial set by using the known expression of the generating function for the sequence of values of this cardinality function.
Keywords: combinatorial generation, and-or tree, generating function, method, ranking, unranking
Authors and copyright holders:
—
For citation:
Shablya Yu. V., Kruchinin D. V. Modification of the algorithm development method for combinatorial generation based on the application of the generating functions theory. Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2019, vol. 22, no. 3, pp. 55–60. DOI: 10.21293/1818-0442-2019-22-3-55-60
Last issue
-2025-1.jpg)
Editorial office address
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 701-582
Viktor N. Maslennikov
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 51-21-21 / 51-43-02
Subscription for updates
