The majority coloring of the join and Cartesian product of some digraph [PDF]
MATEC Web of Conferences, 2022 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
Mixing of Join Point Interfaces and Feature-Oriented Programming for Modular Software Product Line [PDF]
EAI Endorsed Transactions on Scalable Information Systems, 2016 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
A notational Design of Join Points [PDF]
, 2010 Join points are the composition points where aspects are composed with the base system. In other words they are target hooks in the base system where aspect’s implementation is weaved in.
Iqbal, Saqib, Allen, Gary
core +3 more sources
On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n} [PDF]
Opuscula Mathematica, 2021 The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the ...
Michal Staš, Juraj Valiska
doaj +1 more source
The Crossing Number of Cartesian Product of 5-Wheel with any Tree
Discussiones Mathematicae Graph Theory, 2021 In this paper, we establish the crossing number of join product of 5-wheel with n isolated vertices. In addition, the exact values for the crossing numbers of Cartesian products of the wheels of order at most five with any tree T are given.
Wang Yuxi, Huang Yuanqiu
doaj +1 more source
The crossing numbers of join products of four graphs of order five with paths and cycles [PDF]
Opuscula Mathematica, 2023 The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. In the paper, we extend known results concerning crossing numbers of join products of four small graphs with paths ...
Michal Staš, Mária Timková
doaj +1 more source
On the crossing number of join product of the discrete graph with special graphs of order five
Electronic Journal of Graph Theory and Applications, 2020 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 +1 more source
Cyclic Permutations in Determining Crossing Numbers
Discussiones Mathematicae Graph Theory, 2022 The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. Recently, the crossing numbers of join products of two graphs have been studied.
Klešč Marián, Staš Michal
doaj +1 more source
On the Complexity of Inner Product Similarity Join [PDF]
, 2016 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 ...
Ilya Razenshteyn +8 more
core +1 more source
Communication-Efficient Inner Product Private Join and Compute with Cardinality [PDF]
, 2023 Private join and compute (PJC) is a paradigm where two parties owing their private database securely join their databases and compute a function over the combined database. Inner product PJC, introduced by Lepoint et al.
Koji Chida +4 more
core +1 more source