Results 1 to 10 of about 46,480 (299)
Crossing Numbers of Join Product with Discrete Graphs: A Study on 6-Vertex Graphs
Reducing the number of crossings on graph edges can be useful in various applications, including network visualization, circuit design, graph theory, cartography or social choice theory.
Jana Fortes, Michal Staš
doaj +4 more sources
The Cartesian product and join are two classical operations in graphs. Let dL(G)(e) be the degree of a vertex e in line graph L(G) of a graph G. The edge versions of atom-bond connectivity (ABCe) and geometric arithmetic (GAe) indices of G are defined as
Xiujun Zhang +3 more
doaj +4 more sources
On the Complexity of Inner Product Similarity Join [PDF]
A number of tasks in classification, information retrieval, recommendation systems, and record linkage reduce to the core problem of inner product similarity join (IPS join): identifying pairs of vectors in a collection that have a sufficiently large inner product.
Ahle, Thomas D. +3 more
openaire +5 more sources
Grundy dominating sequences on $X$-join product [PDF]
In this paper we study the Grundy domination number on the X-join product G↩R of a graph G and a family of graphs R={Gv:v∈V(G)}. The results led us to extend the few known families of graphs where this parameter can be efficiently computed. We prove that if, for all v∈V(G), the Grundy domination number of Gv is given, and G is a power of a cycle, a ...
Graciela L. Nasini, Pablo Daniel Torres
openaire +5 more sources
Analisis Perbandingan Cartesian Product, Cross Join, Inner Join dan Outer Join dalam Si Akad
Abstrak - Sistematika merupakan salah satu sistem yang dikembangkan dalam lembaga pendidikan. Manajemen sistem informasi akademik yang kurang baik akan mempengaruhi performa dari sistem informasi akademik. Pemilihan query yang kurang tepat akan. Dalam penelitian ini akan dilakukan.
Fatkhur Rochman, Ahmad Wildan L, Juwari
doaj +3 more sources
The majority coloring of the join and Cartesian product of some digraph [PDF]
A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vertices with the same color in the out-neighborhood does not exceed half of its out-degree.
Shi Mei +3 more
doaj +2 more sources
On the crossing number of join product of the discrete graph with special graphs of order five
The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected graph G of order five consisting of the complete graph K4 and of one isolated vertex.
Michal Staš
doaj +2 more sources
Dot-Product Join: An Array-Relation Join Operator for Big Model Analytics [PDF]
Big Model analytics tackles the training of massive models that go beyond the available memory of a single computing device, e.g., CPU or GPU. It generalizes Big Data analytics which is targeted at how to train memory-resident models over out-of-memory training data. In this paper, we propose an in-database solution for Big Model analytics. We identify
Qin, Chengjie, Rusu, Florin
openaire +4 more sources
The Crossing Number of Join of a Special Disconnected 6-Vertex Graph with Cycle
The crossing number of a graph G, cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. There are almost no results concerning crossing number of join of a disconnected 6-vertex graph with cycle. The main aim
Zongpeng Ding, Xiaomei Qian
doaj +3 more sources
Mixing of Join Point Interfaces and Feature-Oriented Programming for Modular Software Product Line [PDF]
Feature-oriented programming (FOP) and aspect-oriented programming (AOP) focus are to modularize additional classes behavior and crosscutting concerns, respectively, for soft- ware evolution.
Cristian Vidal +4 more
doaj +2 more sources

