Sciweavers

8 search results - page 1 / 2
» A Bijection on Dyck Paths and its Cycle Structure
Sort
View
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
13 years 11 months ago
A Bijection on Dyck Paths and its Cycle Structure
The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle st...
David Callan
EJC
2008
13 years 11 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour
DM
2006
91views more  DM 2006»
13 years 11 months ago
Restricted Dumont permutations, Dyck paths, and noncrossing partitions
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 ...
Alexander Burstein, Sergi Elizalde, Toufik Mansour
TPDS
2008
199views more  TPDS 2008»
13 years 10 months ago
DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks
Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due t...
Zhenzhou Zhu, Panos Kalnis, Spiridon Bakiras
COMPGEOM
2010
ACM
14 years 4 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...