Combinatorial Generation Algorithms for Some Lattice Paths Using the Method Based on AND/OR Trees-Reference-Cited by-同舟云学术

Combinatorial Generation Algorithms for Some Lattice Paths Using the Method Based on AND/OR Trees

Published:2023-05-26 Issue:6 Volume:16 Page:266
ISSN:1999-4893
Container-title:Algorithms
language:en
Short-container-title:Algorithms

Author:

Shablya Yuriy¹^ORCID

Affiliation:

1. Laboratory of Algorithms and Technologies for Discrete Structures Research, Tomsk State University of Control Systems and Radioelectronics, 634050 Tomsk, Russia

Abstract

Methods of combinatorial generation make it possible to develop algorithms for generating objects from a set of discrete structures with given parameters and properties. In this article, we demonstrate the possibilities of using the method based on AND/OR trees to obtain combinatorial generation algorithms for combinatorial sets of several well-known lattice paths (North-East lattice paths, Dyck paths, Delannoy paths, Schroder paths, and Motzkin paths). For each considered combinatorial set of lattice paths, we construct the corresponding AND/OR tree structure where the number of its variants is equal to the number of objects in the combinatorial set. Applying the constructed AND/OR tree structures, we have developed new algorithms for ranking and unranking their variants. The performed computational experiments have confirmed the obtained theoretical estimation of asymptotic computational complexity for the developed ranking and unranking algorithms.

Funder

Russian Science Foundation

Publisher

MDPI AG

Subject

Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science

Link

https://www.mdpi.com/1999-4893/16/6/266/pdf

Reference29 articles.

1. Kreher, D.L., and Stinson, D.R. (1999). Combinatorial Algorithms: Generation, Enumeration, and Search, CRC Press.

2. Ruskey, F. (2023, May 01). Combinatorial Generation. Available online: https://page.math.tu-berlin.de/~felsner/SemWS17-18/Ruskey-Comb-Gen.pdf.

3. Knuth, D.E. (2011). The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1, Addison-Wesley Professional.

4. Stanley, R.P. (2012). Enumerative Combinatorics: Volume 1, Cambridge University Press. [2nd ed.].

5. Wallner, M. (2016). Combinatorics of Lattice Paths and Tree-Like Structures. [Ph.D. Thesis, Institute of Discrete Mathematics and Geometry, Vienna University of Technology].