Buscar
Mostrando ítems 11-20 de 46
A new family of expansive graphs
(ELSEVIER SCIENCE BV, 2008-04-01)
An affine graph is a pair (G, ) where G is a graph and is an automorphism assigning to each vertex of G one of its neighbors. On
one hand, we obtain a structural decomposition of any affine graph (G, ) in terms of the ...
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
(EDP Sciences, 2011-07)
A hypergraph is Helly if every family of hyperedges of it, formed by pairwise intersecting hyperedges, has a common vertex. We consider the concepts of bipartite-conformal and (colored) bipartite-Helly hypergraphs. In the ...
Asymmetric Ramsey Properties of Random Graphs Involving Cliques
(JOHN WILEY & SONS INC, 2009)
Consider the following problem: Forgiven graphs G and F(1),..., F(k), find a coloring of the edges of G with k colors such that G does not contain F; in color i. Rodl and Rucinski studied this problem for the random graph ...
Algorithms, parameters and complexity for graph partitioning problems
(Universidade Federal de Minas GeraisBrasilICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃOPrograma de Pós-Graduação em Ciência da ComputaçãoUFMG, 2019-06-27)
Problemas de partição em grafos modelam diferentes tarefas do mundo real, como alocação de recursos ou design de redes tolerantes a falhas. Geralmente, esse problemas são NP-difíceis, e projetar algoritmos cuja complexidade ...
Edge-coloring Of Split Graphs
(CHARLES BABBAGE RES CTRWINNIPEG, 2015)