Sciweavers

10 search results - page 2 / 2
» Bijections for a class of labeled plane trees
Sort
View
DM
1998
60views more  DM 1998»
13 years 4 months ago
On numbers of Davenport-Schinzel sequences
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...
Martin Klazar
EJC
2011
12 years 12 months ago
Enumeration of connected Catalan objects by type
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...
Brendon Rhoades
DIS
2007
Springer
13 years 9 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
13 years 9 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
AROBOTS
2005
115views more  AROBOTS 2005»
13 years 4 months ago
Obstacle Detection and Terrain Classification for Autonomous Off-Road Navigation
Autonomous navigation in cross-country environments presents many new challenges with respect to more traditional, urban environments. The lack of highly structured components in t...
Roberto Manduchi, Andres Castano, A. Talukder, Lar...