✦ LIBER ✦

Counting Dyck Paths by Area and Rank

✍ Scribed by Blanco, Saúl A.; Petersen, T. Kyle

Book ID: 125338340
Publisher: Springer
Year: 2014
Tongue: English
Weight: 469 KB
Volume: 18
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-014-0218-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ranking small regular polygons by area a

Ranking small regular polygons by area and by perimeter

✍ Ch. Audet; P. Hansen; F. Messine 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 843 KB

On Lattice Path Counting by Major Index

On Lattice Path Counting by Major Index and Descents

✍ C. Krattenthaler; S.G. Mohanty 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Lattice Path Counting and Applications.b

Lattice Path Counting and Applications.by Sri Gopal Mohanty

✍ Review by: L. F. Takacs 📂 Article 📅 1983 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 259 KB

Lattice Path Counting and Applications.b

Lattice Path Counting and Applications.by Sri Gopal Mohanty

✍ Review by: M. Knott 📂 Article 📅 1980 🏛 Blackwell Publishing ⚖ 330 KB

Lattice Path Counting and Applications.b

Lattice Path Counting and Applications.by Sri Gopal Mohanty

✍ Review by: John P. Lehoczky 📂 Article 📅 1981 🏛 American Statistical Association 🌐 English ⚖ 88 KB

A finite-difference sieve to count paths

A finite-difference sieve to count paths and cycles by length

✍ Eric Bax; Joel Franklin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 367 KB

We present algorithms to count paths and cycles of a given length in a directed graph. The algorithms have time complexity 0( 2" poly n) and space complexity 0( poly n).