Algorithms for Enumeration of Lattice Paths with Constraints and Rooted Trees by Various Parameters

Approaches to enumerating various types of objects are demonstrated: with restrictions, labeled, and unlabeled. An algorithmic scheme for constructing geometric interpretations of families of combinatorial numbers has been developed. The issues of enumerating planar and nonplanar trees according to...

Full description

Bibliographic Details

Published in:	Journal of mathematical sciences (New York, N.Y.) Vol. 291; no. 3; pp. 357 - 368
Main Authors:	Balagura, A. A., Kuzmin, O. V.
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.06.2025 Springer Nature B.V
Subjects:	Algorithms Combinatorial analysis Enumeration Mathematics Mathematics and Statistics Parameters 05C31 enumeration algorithm planar trees lattice path tree 05E05 06A06 05C05
ISSN:	1072-3374, 1573-8795
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!