Penjadwalan matakuliah di perguruan tinggi scheduling university subjects by Perpustakaan UGM, i-lib

“…Keywords : scheduling, university subjects, assignment method, bipartite graph, activity weighted.…”

Research on Commodities Constraint Optimization Based on Graph Neural Network Prediction by Zhang Yang, Zuo Zhihan, Li Haiying, Zhao Weiyi, Du Qian, Tang Mingjie

“…The present research proposes a prediction model which combines graph convolution neural network and node bipartite graph. Firstly, the node bipartite graph algorithm is used to merge the constraint graph and the store graph, obtaining the “store-constraint bipartite graph”. …”
Get full text

The Median Problem on k-Partite Graphs by Pravas Karuvachery, Vijayakumar Ambat

“…In this paper, we answer a problem on the structure of medians of bipartite graphs by showing that any bipartite graph is the median (or anti-median) of another bipartite graph. …”
Get full text

Skew-spectra and skew energy of various products of graphs by Xueliang Li, Huishu Lian

“…Moreover, we consider the skew energy of the orientation of the lexicographic product $H[G]$ of a bipartite graph $H$ and a graph $G$.…”
Get full text

On the extremal number of subdivisions by Conlon, D, Lee, J

“…More precisely, we show that if H is a C4-free bipartite graph with maximum degree 2 on one side, then there are positive constants C and δ such that every graph with n vertices and Cn3/2−δ edges contains a copy of H⁠. …”

Scheduled QR-BP Detector with Interference Cancellation and Candidate Constraints for MIMO Systems by Sangjoon Park

“…In addition, after obtaining the soft message corresponding to the bit sequence in each transmit symbol, a hard-decision IC operation is performed to reduce the size of the bipartite graph and indirectly update the messages for the remaining symbols. …”
Get full text

A complexity trichotomy for approximately counting list H-colourings by Goldberg, L, Galanis, A, Jerrum, M

“…If H is an irreflexive bipartite graph or a reflexive complete graph then counting list H-colourings is trivially in polynomial time. …”

A complexity trichotomy for approximately counting list H-colourings by Galanis, A, Goldberg, L, Jerrum, M

“…If H is an irreflexive bipartite graph or a reflexive complete graph then counting list H-colourings is trivially in polynomial time. …”

Method for Abnormal Users Detection Oriented to E-commerce Network by DU Hang-yuan, LI Duo, WANG Wen-jian

“…In the e-commerce network,abnormal users often show different behavioral characteristics from normal users.Detecting abnormal users and analyzing their behavior patterns is of great practical significance to maintaining the order of e-commerce platforms.By analyzing the behavior patterns of abnormal users,we abstract the e-commerce network into the heterogeneous information network,and convert it into a user-device bipartite graph.On this basis,we propose a method for detecting abnormal users oriented to e-commerce network——self-supervised anomaly detection model(S-SADM).The model has a self-supervised learning mechanism.It uses an autoencoder to encode the user-device bipartite graph to obtain user node representations.By optimizing the joint objective function,the model completes backpropagation,and uses support vector data descriptions to perform anomaly detection on user node representations.After the automatic iterative optimization of the network,the user node representation has supervised information,and we obtain relatively stable detection results.Finally,S-SADM is validated on 3 real network datasets and a semi-synthetic network dataset,and the experimental results demonstrate the effectiveness and superiority of the method.…”
Get full text

A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs by Guo Ji-Yun, Yin Jian-Hua

“…Let Ks,t be the complete bipartite graph with partite sets of size s and t. Let L1 = ([a1, b1], . . . , [am, bm]) and L2 = ([c1, d1], . . . , [cn, dn]) be two sequences of intervals consisting of nonnegative integers with a1 ≥ a2 ≥ . . . ≥ am and c1 ≥ c2 ≥ . . . ≥ cn. …”
Get full text

Q-MeaMetaVC: An MVC Solver of a Large-Scale Graph Based on Membrane Evolutionary Algorithms by Chunmei Liao, Ping Guo, Jiaqi Gu, Qiuju Deng

“…First, the graph is reduced and divided into two types of connected components (bipartite graph and non-bipartite graph) to reduce the scale of the problem. …”
Get full text

Knowledge Graph Recommendation Model Based on Feature Space Fusion by Suqi Zhang, Xinxin Wang, Rui Wang, Junhua Gu, Jianxin Li

“…The existing recommendation model based on a knowledge graph simply integrates the behavior features in a user–item bipartite graph and the content features in a knowledge graph. …”
Get full text

Some Properties of Regular Line Graphs by Akram Attar

“…Further, the necessary and sufficient condition for regular line graph to be bipartite graph have also been proved. Key words: Line Graphs, Regular graphs, Connected graphs, Bipartite Graphs. …”
Get full text

Star metric dimension of complete, bipartite, complete bipartite and fan graphs by Reni Umilasari, Ilham Saifudin, Isnawati Lujeng Lestari

“…Besides complete bipartite graph hasn’t star metric dimension or  for m,n≥3 or it can said that  Sdim (K(m,n) )=0. …”
Get full text

Radio number of 2− super subdivision for path related graphs by Baskar Mari, Ravi Sankar Jeyaraj

“…. $ A graph H is said to be an $ m $ super subdivision if $ G $ is replaced by the complete bipartite graph $ K_{m, m} $ with $ m = 2 $ in such a way that the end vertices of the edge are merged with any two vertices of the same partite set $ X $ or $ Y $ of $ K_{m, m} $ after removal of the edge of $ G $. …”
Get full text

Sidorenko's conjecture, graph norms, and pseudorandomness by Lee, J

“…This conjecture is closely related to Sidorenko's conjecture in the sense that it is true for every bipartite graph H that satisfies Sidorenko's conjecture. …”

Competitive algorithms for online matching and vertex cover problems by Wong, Chiu Wai, M. Eng. Massachusetts Institute of Technology

Get full text

Discovery of protein complexes with core-attachment structures from tandem affinity purification (TAP) data by Wu, Min, Li, Xiaoli, Kwoh, Chee Keong, Ng, See-Kiong, Wong, Limsoon

“…CACHET models the TAP data as a bipartite graph in which the two vertex sets are the baits and the preys, respectively. …”
Get full text
Get full text

Some Properties of Regular Line Graphs by Akram Attar

“…Further, the necessary and sufficient condition for regular line graph to be bipartite graph have also been proved. Key words: Line Graphs, Regular graphs, Connected graphs, Bipartite Graphs. …”
Get full text

Some Properties of Regular Line Graphs by Akram Attar

“…Further, the necessary and sufficient condition for regular line graph to be bipartite graph have also been proved. Key words: Line Graphs, Regular graphs, Connected graphs, Bipartite Graphs. …”
Get full text