On lattice path enumeration
A lattice path from (a b) to (c d) on the grid Z Z with step set S is a nite sequence of ordered pairs (x0 y0) (x1 y1) : : : (xn yn) on Z Z such that the initial point satisfies (a b) = (x0 y0), the terminal point satisfies (c d) = (xn yn), and the points in between satisfy (xi+1 yi+1) = (xi yi)+ fo...
Saved in:
Main Authors: | Dionisio, Celine, Kim, Junhee |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2019
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/18563 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
A Zero-Suppressed Binary Decision Diagram Approach for Constrained Path Enumeration
by: Tan, Renzo Roel P, et al.
Published: (2019) -
Cupping in the computably enumerable degrees
by: Tran, Hong Hanh
Published: (2023) -
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration
by: Sun, S, et al.
Published: (2022) -
Exploiting branch constraints without exhaustive path enumeration
by: Chen, T., et al.
Published: (2014) -
Enumeration of small nonisomorphic 1-rotational twofold triple systems
by: Royle, Gordon F., et al.
Published: (2011)