123 search results - page 7 / 25 » Enumerating Triangulation Paths |
MFCS
2004
Springer
14 years 22 days ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
COMBINATORICS
2006
13 years 7 months ago
2006
In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (...
DM
2006
13 years 7 months ago
2006
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some ...
ICTAI
2005
IEEE
14 years 29 days ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
EJC
2007
13 years 7 months ago
2007
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. The...