Buscar
Mostrando ítems 1-10 de 234
k-tuple colorings of the Cartesian product of graphs
(Elsevier Science, 2017-01)
A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two vertices are adjacent, the corresponding sets of colors are disjoint. The k-tuple chromatic number of G, χk(G), is the smallest ...
Optimization of algorithm to identification of duplicate tuples through similarity phonetic based on multithreading
(2011-12-01)
Aiming to ensure greater reliability and consistency of data stored in the database, the data cleaning stage is set early in the process of Knowledge Discovery in Databases (KDD) and is responsible for eliminating problems ...
Optimization of algorithm to identification of duplicate tuples through similarity phonetic based on multithreading
(2011-12-01)
Aiming to ensure greater reliability and consistency of data stored in the database, the data cleaning stage is set early in the process of Knowledge Discovery in Databases (KDD) and is responsible for eliminating problems ...
On the complexity of { k } -domination and k-tuple domination in graphs
(Elsevier Science, 2015-06)
We consider two types of graph domination - {k}-domination and k-tuple domination, for a fixed positive integer k - and provide new NP-complete as well as polynomial time solvable instances for their related decision ...
The linear dynamic of a hypercyclic tuple of operators such as bihypercyclicity generatorLa dinámica lineal de una N-upla de operadores hipercíclica como generadora de la bihiperciclidad
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 2017)
The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs
(Elsevier Science, 2010-08)
The notion of k-limited packing in a graph is a generalization of 2-packing. For a given non negative integer k, a subset B of vertices is a k-limited packing if there are at most k elements of B in the closed neighborhood ...
Complexity of k-tuple total and total {k}-dominations for some subclasses of bipartite graphs
(Elsevier Science, 2018-10)
We consider two variations of graph total domination, namely, k-tuple total domination and total {k}-domination (for a fixed positive integer k). Their related decision problems are both NP-complete even for bipartite ...
Enriquecimento de dados: uma pré-etapa em relação à limpeza de dados
(Universidade Estadual Paulista (Unesp), 2012-07-12)
A incidência de tuplas duplicadas é um problema significativo e inerente às grandes bases de dados atuais. Trata-se da repetição de registros que, na maioria das vezes, são representados de formas diferentes nas bases de ...