Enumeration results for alternating tree families

15 years 3 months ago

Download info.tuwien.ac.at

We study two enumeration problems for up-down alternating trees, i.e., rooted labelled trees T, where the labels v1, v2, v3, . . . on every path starting at the root of T satisfy v1 < v2 > v3 < v4 >

Markus Kuba, Alois Panholzer

Real-time Traffic

EJC 2007 | EJC 2010 | Root Node | Up-down Alternating Trees | Various Tree Families |

claim paper

» NOTUNG A Program for Dating Gene Duplications and Optimizing Gene Family Trees

» An exploration of alternative visualisations of the basic helixloophelix protein interacti...

» A New Family of HighPerformance Parallel Decimal Multipliers

» Assessing the ability of sequencebased methods to provide functional insight within membra...

» Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees

» SIGOPT Using Schema to Optimize XML Query Processing

» TreePattern Queries on a Lightweight XML Processor

» PentaPlot A software tool for the illustration of genome mosaicism

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	EJC
Authors	Markus Kuba, Alois Panholzer

Comments (0)

Sciweavers

Enumeration results for alternating tree families

EJC 2007 | EJC 2010 | Root Node | Up-down Alternating Trees | Various Tree Families |

Explore & Download

Productivity Tools

Sciweavers