Sciweavers

4137 search results - page 116 / 828
» On the number of matchings of a tree
Sort
View
JSAC
2006
100views more  JSAC 2006»
15 years 6 months ago
An improved algorithm for optimal lightpath establishment on a tree topology
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
JCT
2008
53views more  JCT 2008»
15 years 6 months ago
A major index for matchings and set partitions
We introduce a statistic pmaj(P) for partitions of [n], and show that it is equidistributed with cr2, the number of 2-crossings, over all partitions of [n] with given sets of mini...
William Y. C. Chen, Ira M. Gessel, Catherine H. Ya...
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
15 years 12 months ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
IANDC
2011
129views more  IANDC 2011»
15 years 1 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
ICML
2007
IEEE
16 years 7 months ago
Infinite mixtures of trees
Finite mixtures of tree-structured distributions have been shown to be efficient and effective in modeling multivariate distributions. Using Dirichlet processes, we extend this ap...
Sergey Kirshner, Padhraic Smyth