446 search results - page 67 / 90 » A Combinatorial Theorem for Trees |
JCT
2007
15 years 1 months ago
2007
Abstract. We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain ...
DM
1998
15 years 1 months ago
1998
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bij...
91
Voted
PRL
1998
15 years 1 months ago
1998
In this paper, we present a new approach for encrypting binary images. Putting different scan patterns at the same level in Ž .the scan tree structure and employing a two-dimensi...
142
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
121
Voted
EJC
2011
14 years 8 months ago
2011
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...