Results 31 to 40 of about 46,607 (299)
Quadripartitioned Neutrosophic Graph Structures [PDF]
Neutrosophic Sets and Systems, 2022 The quadripartitioned neutrosophic set is the partition of indeterminacy function of the neutrosophic set into contradiction part and ignorance part.
S. Satham Hussain +5 more
doaj +1 more source
Supporting virtual teamwork in Collaborative Product Development [PDF]
, 2011 The increasing product complexity and the continuous need of improving product quality and services force companies to join into distributed and extended networks.
Germani M +3 more
core +1 more source
Approximate Top-k Inner Product Join with a Proximity Graph [PDF]
Nakama H., Amagata D., Hara T.. Approximate Top-k Inner Product Join with a Proximity Graph. Proceedings - 2021 IEEE International Conference on Big Data, Big Data 2021 , 4468 (2021); https://doi.org/10.1109/BigData52589.2021.9671858.This paper addresses
Amagata, Daichi +2 more
core +4 more sources
Product Pre-Launch Prediction From Resilient Distributed e-WOM Data
IEEE Access, 2020 Pre-launch success prediction of a product is a challenge in today's electronic world. Based on this prediction, industries can avoid huge losses by deciding on whether to launch or not to launch a product into the market.
Sandhya Narayanan +2 more
doaj +1 more source
Fool’s solitaire on joins and Cartesian products of graphs
Discrete Mathematics, 2015 Peg solitaire is a game generalized to connected graphs by Beeler and Hoilman. In the game pegs are placed on all but one vertex. If $xyz$ form a 3-vertex path and $x$ and $y$ each have a peg but $z$ does not, then we can remove the pegs at $x$ and $y$ and place a peg at $z$. By analogy with the moves in the original game, this is called a jump.
Jennifer Wise, Sarah Loeb
openaire +3 more sources
Weakly Perfect Graphs of Modules [PDF]
Control and Optimization in Applied Mathematics, 2019 In this study, $R$ and $M$ are assumed to be a commutative ring with non-zero identity $M$ and an $R$-module, respectively. Scalar Product Graph of $M$, denoted by $G_R(M)$, is a graph with the vertex-set $M$ and two different vertices $a$ and $b$ in $M$
Mostafa Nouri Jouybari +2 more
doaj +1 more source
The dominant strong metric dimension of graphs
AKCE International Journal of Graphs and CombinatoricsGraphs are useful for analyzing the structure models in computer science, operations research, and sociology. Also, different types of graph products have several applications in modeling, including those found in network analysis, communication ...
M. Valiyanpour +2 more
doaj +1 more source
Join irreducible semigroups [PDF]
, 2019 We begin a systematic study of finite semigroups that generate join irreducible members of the lattice of pseudovarieties of finite semigroups, which are important for the spectral theory of this lattice.
Lee, Edmond W. H. +2 more
core +1 more source
Frequency-Adaptive Join for Shared Nothing Machines [PDF]
, 1999 Although many skew-handling algorithms have been proposed for simple join operations, they remain generally inefficient in the case of $\theta$-join and in the case of multi-join. A new method for self-balancing equi-join operations on shared-nothing (SN)
Hains, Gaetan, Bamha, Mostafa
core +2 more sources
Mathematics, 2020 The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete ...
Michal Staš
doaj +1 more source