IJPAM: Volume 56, No. 4 (2009)

AN EFFICIENT REPRESENTATION FOR SOLVING
CATALAN NUMBER RELATED PROBLEMS

Matej Crepinšek$^1$, Luka Mernik$^2$
$^1$Faculty of Electrical Engineering and Computer Science
University of Maribor
Smetanova Ulica 17, Maribor, 2000, SLOVENIA
e-mail: matej.crepinsek@uni-mb.si
$^2$Vestavia Hills High School
2235, Lime Rock Dr., Vestavia Hills, AL 35216, USA
e-mail: lmernik@hotmail.com


Abstract.Nowadays, more and more computations, in artificial intelligence, knowledge representation, and scientific computations to name a few, require complex data processing and sophisticated algorithms, which are NP hard. Solutions to such problems might range from succinct data representations to parallelized and incremental algorithms. In this paper Catalan related problems are discussed. For efficient computation of Catalan combinations a succinct representation is used and several algorithms are developed. Results show that the suggested approach can be successfully used for solving different Catalan problems.

Received: September 28, 2009

AMS Subject Classification: 68P05

Key Words and Phrases: algorithms and data structures, Catalan numbers, enumeration of Catalan combinations, incremental algorithms

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2009
Volume: 56
Issue: 4