|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|