Buscar
Mostrando ítems 21-29 de 33
Seleção de representantes para cobertura de componentes conexas em grafos
(Universidade Federal de Minas GeraisUFMG, 2018-12-17)
Based on the generalization of connectivity problems in ad hoc communication networks, widely studied in the literature, we introduce a new covering problem, called Componet Cover by Vertices (CCV). In this problem, we are ...
Efficient approximations of conjunctive queries
(Society for Industrial and Applied Mathematics, 2014)
When finding exact answers to a query over a large database is infeasible, it is natural
to approximate the query by a more efficient one that comes from a class with good bounds on the
complexity of query evaluation. ...
Injective Colorings with Arithmetic Constraints
(Springer, 2015)
An injective coloring of a graph is a vertex labeling such that two vertices sharing a common neighbor get different labels. In this work we introduce and study what we call additive colorings. An injective coloring of a ...
Model-Checking on Ordered Structures
(ACM, 2020)
We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable ...
Calculo del clique-width en graficas simples de acuerdo a su estructura
(Universidad Autónoma del Estado de México, 2018)
Aproximaciones eficientes de consultas conjuntivas
(Universidad de Chile, 2012)
Cuando encontrar la respuesta exacta a una consulta sobre una base de datos muy grande es intratable, es natural aproximar la consulta por otra más eficiente que pertenezca a una clase con buenas cotas en la complejidad ...
Monochromatic cycle partitions
(Universidad de Chile, 2017)
The first part of this thesis concerns monochromatic cycle partitions.
We make the following three contributions.
Our first result is that for any colouring of the edges of the complete bipartite graph $K_{n,n}$ with 3 ...
Towards the computation of motif-based centrality measures over real-world networks
(2023)
Las medidas de centralidad han probado ser una herramienta valiosa para analizar datos en forma de grafos. Algunas aplicaciones sobre bases de datos de grafos, tales como grafos de conocimiento o motores de búsqueda en la ...