-
361
-
362
-
363
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover
Published 2014“…The modification uses a combinatorial construction of a bipartite graph in which any coloring of the first side that does not use a color for more than a small fraction of the vertices, makes most vertices on the other side have their neighbors all colored in different colors.…”
Get full text
Get full text
Article -
364
Radio Labeling of Supersub—Division of Path Graphs
Published 2023-01-01“…In this paper, we determine the radio number <inline-formula> <tex-math notation="LaTeX">$rn(G)$ </tex-math></inline-formula> of <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula> where <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula> is the supersub−division of a path <inline-formula> <tex-math notation="LaTeX">$P_{n}$ </tex-math></inline-formula> with <inline-formula> <tex-math notation="LaTeX">$n \geq 3$ </tex-math></inline-formula> vertices and a complete bipartite graph <inline-formula> <tex-math notation="LaTeX">$K_{2, \alpha }$ </tex-math></inline-formula> with <inline-formula> <tex-math notation="LaTeX">$\alpha \in \mathbb {N}$ </tex-math></inline-formula>.…”
Get full text
Article -
365
An algebraic semigroup method for discovering maximal frequent itemsets
Published 2022-11-01“…In the literature, generating maximal frequent itemsets proves either to be NP-hard or to have O(l34l(m+n))O\left({l}^{3}{4}^{l}\left(m+n)) complexity in the worst case from the perspective of generating maximal complete bipartite graphs of a bipartite graph, where mm, nn are the item number and the transaction number, respectively, and ll denotes the maximum of ∣C∣∣Ψ(C)∣/(∣C∣+∣Ψ(C)∣−1)| C| | \Psi \left(C)| \hspace{0.1em}\text{/}\hspace{0.1em}\left(| C| +| \Psi \left(C)| -1), with the maximum taken over all maximal frequent itemsets CC. …”
Get full text
Article -
366
On the $ A_{\alpha^-} $-spectra of graphs and the relation between $ A_{\alpha} $- and $ A_{\alpha^-} $-spectra
Published 2024-01-01“…Akbari et al. in $ (2010) $ as follows: for $ \alpha\in[\frac{1}{2}, 1) $, if $ \, \, \, 0 < \beta\leq 1 $ or $ \, 2\leq\beta\leq 3 $, then $ S^{\alpha}_{\beta}(G)\geq S^{\alpha^-}_{\beta}(G), $ and if $ \, 1\leq\beta\leq 2 $, then $ S^{\alpha}_{\beta}(G)\leq S^{\alpha^-}_{\beta}(G), $ where the equality holds if and only if $ G $ is a bipartite graph such that $ \beta \notin \{1, 2, 3\}. …”
Get full text
Article -
367
Design and Comparative Analysis of New Personalized Recommender Algorithms with Specific Features for Large Scale Datasets
Published 2020-07-01“…The significant differences are obtained in these methods because the structure of computation of the methods depends on the number of user attributes, λ, the number of bipartite graph edges, and |L|. The better values of the (<i>Precision</i>, <i>Recall</i>) metrics obtained with size as 3000 for the large scale <i>Book-Crossing</i> dataset in the proposed methods are (0.0004, 0.0042) and (0.0004, 0.0046) respectively. …”
Get full text
Article -
368
MFIDMA: A Multiple Information Integration Model for the Prediction of Drug–miRNA Associations
Published 2022-12-01“…Specifically, we first formulated known DMA as a bipartite graph and utilized structural deep network embedding (SDNE) to learn the topological features from the graph. …”
Get full text
Article -
369
A Multimedia Graph Collaborative Filter
Published 2022-01-01“…However, the users’ preferences for different modalities are unknown. The bipartite graph structure for the entire modalities should differ from the single modality. …”
Get full text
Article -
370
Efficient crowdsourcing for multi-class labeling
Published 2021“…Technically, the algorithm is based on low-rank approximation of weighted adjacency matrix for a random regular bipartite graph, weighted according to the answers provided by the workers.…”
Get full text
Article -
371
Efficient crowdsourcing for multi-class labeling
Published 2022“…Technically, the algorithm is based on low-rank approximation of weighted adjacency matrix for a random regular bipartite graph, weighted according to the answers provided by the workers.…”
Get full text
Article -
372
Every graph is local antimagic total and its applications
Published 2023-07-01“…We then determined the exact \(\chi_{lat}(G)\), where \(G\) is a complete bipartite graph, a path, or the Cartesian product of two cycles. …”
Get full text
Article -
373
Assessing the Vulnerability of the Fiber Infrastructure to Disasters
Published 2018“…First, we consider a simplistic bipartite graph model and present a polynomial-time algorithm for finding a worst-case vertical line segment cut. …”
Get full text
Get full text
Article -
374
-
375
-
376
Efficient crowdsourcing for multi-class labeling
Published 2014“…Technically, the algorithm is based on low-rank approximation of weighted adjacency matrix for a random regular bipartite graph, weighted according to the answers provided by the workers.…”
Get full text
Get full text
Article -
377
A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem
Published 2009“…During crossover, the OCGA selects two parents from the population and replaces them with two children by an optimized crossover mechanism which designed using an undirected bipartite graph. Various techniques are also introduced to further enhance the solution quality. …”
Conference or Workshop Item -
378
Heterogeneous graph construction and HinSAGE learning from electronic medical records
Published 2022-12-01“…This study aims to address the challenge of implementing a complex and highly heterogeneous dataset, including the following: (1) demonstrating how to build a multi-attributed and multi-relational graph model (2) and applying a downstream disease prediction task of a patient’s prognosis using the HinSAGE algorithm. We present a bipartite graph schema and a graph database construction in detail. …”
Get full text
Article -
379
SilkMoth: an efficient method for finding related sets with maximum matching constraints
Published 2019“…A common metric is to measure the relatedness of two sets by treating the elements as vertices of a bipartite graph and calculating the score of the maximum matching pairing between elements. …”
Get full text
Article -
380