Buscar
Mostrando ítems 11-20 de 33
Complexity, lower bounds, and algorithms for searching infected nodes in uncertain trees
(2023)
Abordamos el desafío de identificar nuevos brotes de COVID-19 a través de la red de aguas residuales de una ciudad. Es posible que tengamos información parcial de la red. En particular, una serie de tuberías no identificables ...
Quelques propriétés topologiques des graphes et applicatións a internet et aux réseaux
(2015)
Introduction. Internet, depuis sa création, souleve de nombreuses problématiques. Son étude, entant que phénomene social et technologique, embrasse plusieurs domaines de recherche.La démocratisation des moyens de communication ...
Computing the Clique-width of Cactus Graphs
(ELSEVIER, 2017)
New complexity bounds for evaluation and containment of graph query languages
(Universidad de Chile, 2016)
Las bases de datos de grafos han recibido mucho interés en los últimos años, debido a sus aplicaciones en temas como las redes sociales o la Web Semántica. En esta tesis estudiamos lenguajes de consultas que poseen las ...
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 ...
On automata networks dynamics: an approach based on computational complexity theory
(Universidad de Chile, 2021)
An automata network (AN) is a network of entities, each holding a state from a finite set and related by a graph structure called an \emph{interaction graph}. Each node evolves according to the states of its neighbors in ...
Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques.
Let P(G,X) be a property associating a boolean value to each pair (G, X) where G is a graph and X is a vertex subset. Assume that P is expressible in counting monadic second order logic (CMSO) and let t be an integer ...
The homomorphism problem for regular graph patterns
(IEEE, 2017)
The evaluation of conjunctive regular path queries– which form the navigational core of the query languagesfor graph databases – raises challenges in the context of thehomomorphism problem that are ...