|
|
|
|
|
Anne Berry and Geneviève Simonet
The atom graph of a graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient algorithms for computing ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chuan-Min Lee
This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {??}
{
k
}
-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Derek H. Smith, Roberto Montemanni and Stephanie Perkins
Let ??=(??,??)
G
=
(
V
,
E
)
be an undirected graph with vertex set V and edge set E. A clique C of G is a subset of the vertices of V with every pair of vertices of C adjacent. A maximum clique is a clique with the maximum number of vertices. A tabu se...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sikha S. Bagui, Dustin Mink, Subhash C. Bagui, Michael Plain, Jadarius Hill and Marshall Elam
There has been a great deal of research in the area of using graph engines and graph databases to model network traffic and network attacks, but the novelty of this research lies in visually or graphically representing the Reconnaissance Tactic (TA0043) ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Geneviève Simonet and Anne Berry
The atom graph of a connected graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all its atom trees. A graph G is an atom graph if there is a graph whose atom g...
ver más
|
|
|
|
|
|
|
|
|
|
|
Miroslaw Kowaluk and Andrzej Lingas
We introduce the concept of a k-dimensional matrix product D of k matrices A1,…,Ak" role="presentation">??1,?,????A1,?,Ak
A
1
,
?
,
A
k
of sizes n1×n,…,nk×n," role="presentation">??1×??,?,????×??,n1×n,?,nk×n,
n
1
...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jinyu Guo and Lizhen Wang
The goal of spatial co-location pattern mining is to find subsets of spatial features whose instances are often neighbors in a geographical space. In many practical cases, instances of spatial features contain not only spatial location information but al...
ver más
|
|
|
|
|
|
|
|
|
|
|
Aaron Barbosa, Elijah Pelofske, Georg Hahn and Hristo N. Djidjev
Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Phonexay Vilakone and Doo-Soon Park
This article investigates the efficiency of a doParallel algorithm and a formal concept analysis (FCA) network graph applied to recommendation systems. It is the first article using the FCA method to create a network graph and apply this graph to improve...
ver más
|
|
|
|
|
|
|
|
|
|
|
Elias Munapo
Pág. 6 - 10
The paper presents a new method for solving the 0?1 linear programming problems (LPs). The general 0?1 LPs are believed to be NP-hard and a consistent, efficient general-purpose algorithm for these models has not been found so far. Cutting planes an...
ver más
|
|
|
|
|
|
|
|
|
|
|
Stephen Winters-Hilt and Andrew J. Lewis
One of the main limitations of the typical hidden Markov model (HMM) implementation for gene structure identification is that a single structure is identified on a given sequence of genomic data?i.e., identification of overlapping structure is not direct...
ver más
|
|
|
|
|
|
|
|
|
|
|
Gerardo Muñoz, Alejandro Rubiano
Pág. 35 - 43
AbstractDownloadsReferencesHow to Cite
|
|
|
|
|
|
|
|
|
|
|
Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen Kobourov, Giuseppe Liotta, Alfredo Navarra and Alessandra Tappini
This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique. h-Clique2Path Plan...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xiangyu Long, Shufan Wu, Xiaofeng Wu, Yixin Huang and Zhongcheng Mu
This paper presents a space mission planning tool, which was developed for LEO (Low Earth Orbit) observation satellites. The tool is focused on a two-phase planning strategy with clustering preprocessing and mission planning, where an improved clustering...
ver más
|
|
|
|
|
|
|
|
|
|
|
Marcela Fernanda da Paz de Souza,Frederico Oliveira Henriques
Pág. 45 - 61
O objetivo da pesquisa é verificar a formação de uma rede de enfrentamento à violência contra as mulheres do campo, das florestas e das águas no Estado do Pará. O estudo realiza o levantamento dos dados primários junto à CIPM-PA, e, baseando-se na aborda...
ver más
|
|
|
|
|
|
|
|
|
|
|
Matheus H. M. Pericini, Lucas G. M. Leite, Francisco H. De Carvalho-Junior, Javam C. Machado and Cenez A. Rezende
MapReduce is a parallel computing model in which a large dataset is split into smaller parts and executed on multiple machines. Due to its simplicity, MapReduce has been widely used in various applications domains. MapReduce can significantly reduce the ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Muquan Zou, Lizhen Wang, Pingping Wu and Vanha Tran
A co-location pattern is a set of spatial features whose instances are frequently correlated to each other in space. Its mining models always consist of two essential steps. One step is to generate neighbor relationships between spatial instances, and an...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tapani Toivonen and Markku Tukiainen
Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such a problem is maximum clique, which?under standard assumptions in complexity theory?cannot be solved in sub-exponential time...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ronald D. Hagan and Michael A. Langston
Recent discoveries of distinct molecular subtypes have led to remarkable advances in treatment for a variety of diseases. While subtyping via unsupervised clustering has received a great deal of interest, most methods rely on basic statistical or machine...
ver más
|
|
|
|
|
|
|
|
|
|
|
Matheus H. M. Pericini, Lucas G. M. Leite, Francisco H. De Carvalho-Junior, Javam C. Machado and Cenez A. Rezende
MapReduce is a parallel computing model in which a large dataset is split into smaller parts and executed on multiple machines. Due to its simplicity, MapReduce has been widely used in various applications domains. MapReduce can significantly reduce the ...
ver más
|
|
|
|
|
|