Sciweavers

4137 search results - page 65 / 828
» On the number of matchings of a tree
Sort
View
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
15 years 2 months ago
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose
Patrik Floréen, Petteri Kaski, Valentin Pol...
ICDE
2010
IEEE
174views Database» more  ICDE 2010»
14 years 12 months ago
Semantic flooding: Search over semantic links
Abstract-- Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one le...
Fausto Giunchiglia, Uladzimir Kharkevich, Alethia ...
134
Voted
DAM
2011
14 years 9 months ago
Minimum sum set coloring of trees and line graphs of trees
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
Flavia Bonomo, Guillermo Durán, Javier Mare...
GPEM
2000
103views more  GPEM 2000»
15 years 1 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
84
Voted
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
15 years 1 months ago
Matchings Avoiding Partial Patterns
We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on t...
William Y. C. Chen, Toufik Mansour, Sherry H. F. Y...