Buscar
Mostrando ítems 11-20 de 518
Partitioning edge-colored hypergraphs into few monochromatic tight cycles
(Siam, 2020)
Confirming a conjecture of Gyarfas, we prove that, for all natural numbers k and r, the vertices of every r-edge-colored complete k-uniform hypergraph can be partitioned into a bounded number (independent of the size of ...
SOME RESULTS ON POLARIZED PARTITION RELATIONS OF HIGHER DIMENSION
(Johann Ambrosius Barth VerlagHeidelbergAlemanha, 1993)
Avaliação do impacto da seleção de partições base em ensemble multiobjetivo
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Ciência da Computação - PPGCC-SoCâmpus Sorocaba, 2018-02-23)
Unsupervised data clustering is not a trivial process, as no previous knowledge is available
and real data is often complex and multi-faceted. To make matters worse, traditionally,
clustering aims to describe the data ...
Almost partitioning A 3-edge-colored Kn,n into five monochromatic cycles
(Society for Industrial and Applied Mathematics Publications, 2017)
We show that for any coloring of the edges of the complete bipartite graph Kn,n with three colors there are five disjoint monochromatic cycles which together cover all but o(n) of the vertices. In the same situation, 18 ...