A combinatorial interpretation for a super-Catalan recurrence.

Callan, David

Displaying similar documents to “A combinatorial interpretation for a super-Catalan recurrence.”

On Sequences $G_{n}$ satisfying $G_{n} = (d + 2) G_{n - 1} - G_{n - 2}$ .

Chen, Ricky X.F., Shapiro, Louis W. (2007)

Journal of Integer Sequences [electronic only]

Similarity:

Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.

Nardelli, Enrico, Proietti, Guido, Widmayer, Peter (2001)

Journal of Graph Algorithms and Applications

Similarity:

Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.

Bonichon, Nicolas, Gavoille, Cyril, Hanusse, Nicolas (2005)

Journal of Graph Algorithms and Applications

Similarity:

Level planar embedding in linear time.

Jünger, Michael, Leipert, Sebastian (2002)

Journal of Graph Algorithms and Applications

Similarity:

On graceful trees.

Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)

Applied Mathematics E-Notes [electronic only]

Similarity:

Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees.

Schaeffer, Gilles (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Programming and Testing a Two-Tree Algorithm

Vassilev, Tzvetalin, Ammerlaan, Joanna (2013)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): G.2.2, F.2.2. Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm. We briefly discuss the algorithm and present example that helps the reader grasp the main algorithmic ideas. Further, we discuss the important stages in the implementation of the algorithm and justify the decisions taken. Then, we present experimental...