From Enumerating to Generating: A Linear Time Algorithm for Generating 2D Lattice Paths with a Given Number of Turns

From Enumerating to Generating: A Linear Time Algorithm for Generating 2D Lattice Paths with a Given Number of Turns

We propose a linear time algorithm, called G2DLP, for generating 2D lattice L(n1, n2) paths, equivalent to two-item  multiset permutations, with a given number of turns. The usage of turn has three meanings: in the context of multiset permutations, i...

Full description

Bibliographic Details
Main Author: Ting Kuo
Format: Article
Language:English
Published: MDPI AG 2015-05-01
Series:Algorithms
Subjects:
Lattice Path
Multiset Permutation
Turns
Integer Partition
Cryptography
Open Shop Scheduling
Online Access:http://www.mdpi.com/1999-4893/8/2/190

Internet

http://www.mdpi.com/1999-4893/8/2/190

Similar Items