BIPARTITE相关论文
For multi-agent systems with competitive and collaborative relationships,signed graph can more intuitively express the c......
IN this note all graphs are undirected, finite and simple. For a subgraph H of G,ε（H） andμ（H） denote the number of edges i......
IN this note all graphs are undirected, finite and simple. For a subgraph H of G, V(H), E(H), ε(H) and μ(H) denote the......
Maximum satisfiability (MAX SAT) problem is an optimization version of the satisfiability (SAT) problem. This problem ar......
The wavelength assignment with multiple multicast requests in fixed routing WDM network is studied.A new multicast dynam......
Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted......
In this paper,a general resource distribution game with a hierarchical structure on the bipartite graph is proposed.In t......
Recently there has been an increasing interest in applying random walk based methods to recommender systems. We employ a......
阜阳市局 ￡4a 局长——_MINtkMMtgj’＃lnH＄B——q.M——D收束志不他只邀狲位J则【科校为先导推动地租工作.B为广为戳民U用凶盼引眯B.......
Predictive Characteristics of Co-authorship Networks: Comparing the Unweighted, Weighted, and Bipart
Purpose: This study aims to answer the question to what extent different types of networks can be used to predict future......
Predicting the Nuclear Localization Signals of 107 Types of HPV L1 Proteins by Bioinformatic Analysi
In this study, 107 types of human papillomavirus (HPV) L1 protein sequences were obtained from available databases, and ......
A scheme for teleporting an unknown two-particle entangled state is proposed. In comparison with the recent protocol (Co......
In this paper,a special class of bipartite graph called the complementary partitive graph isdefined.By using the define......
In this paper, we consider a network communication delay improvement problem, which is to upgrade nodes in a network wit......
Tornado codes have been used in the error control of data transmission in IP network. The efficiency of this erasure cod......
The lerp-forming psyllids is very common in the Australian region, such as Spondy?iaspis (Signore, 1879), Cardiaspina (......
This paper is concerned with (3,n) and (4,n) regular quasi-cyclic Low Density Parity Check (LDPC) code constructions fro......
Dear editor,At Asiacrypt 2011,Bogdanov et al.[1]formally defined the biclique cryptanalysis method and proposed the firs......
In this paper,we improve the trawling and point out some communities missed by trawling. We use the DBG(Dense Bipartite ......
The single machine parallel batch problem with job compatibility is considered to minimize makespan,where the job compat......
A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implem......
...
We propose a pilot domain non-orthogonal multiple access(NOMA)for uplink massive devices grant-free random access scenar......
利用图论方法研究不完备的三对角全符号矩阵的最小秩完备化问题.通过符号二部图的二部迫零法获得不完备的三对角全符号矩阵的最小......
提出了粒子群算法的一种新的个性因子，以改进其求解组合优化问题的效果．个性因子是基于对社会心理学的观察而对每个粒子增加的一个新......
阶为n的图G的圈长分布是序列(c1,c2,…,cn),其中ci是图G中长为i的圈数.得到如下结果:(1)设A(∈)E(Kn,n),则当Kn,n[A]≌K1,j或Kn,n[......
优美图是图论中的一个重要分支,随着计算机的发展,图的标号在网络和通讯等领域中的应用越来越广泛。文章讨论了优美二部图粘接路所......
在对完全二部图K3,3进行k-边着色中，记brk（Kt,t）为能够诱导出单色Kt，t的最小的正整数n，另外，记z（n；t）为Kn,n中不含子图Kt,t最大的边数。对t=......
本文完全解决了阶为2m+2的m-正则图的Hamilton连通性问题。主要结果是:任一个既不是二部图也不是具有类型T的阶为2m+2,m≥4的m-正......
The hedgehog asymptotic of skyrmion obviously mixes the spatial and isotopic d.o.f.. The local gauge invariance requires......
推荐系统是电子商务领域最重要的技术之一,而协同过滤算法又是推荐系统用得最广泛的.提出了一种基于加权三部图网络的协同过滤算法......
For an asymmetric matrix,the zero-nonzero pattern P of entries can be described by a digraphΓ(P)which has an arc if an ......
Let G be a properly colored bipartite graph. A rainbow matching of G is such a matching in which no two edges have the s......
Let be a simple graph with vertex set V and edge set E. A function is said to be a reverse total signed vertex dominatin......
In the past ten years, community detection in complex networks has attracted more and more attention of researchers. Com......
Bipartite Laparoscopic Cholecystectomy: New Technique for Avoiding Bile Duct Injury in Difficult Cas
The incidence of bile duct injury in laparoscopic cholecystectomy (LC) is still two times greater compared to classic op......
Two multi-objective programming models are built to describe Pilots’ full flight simulator (FFS) recurrent training (PF......
The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and......
We compare and contrast asymmetry and nestedness, two concepts used in the characterisation of the specialist-generalist......
Let H<sub>n,m</sub> be the number of rooted non-isomorphic bipartite planar maps with m edges and the valency of the roo......
...
Let G=(V, E)be a simple graph without isolated vertices. For positive integer κ, a 3-valued function f:V → {-1, 0, 1} ......
The optimal semi-matching problem is one relaxing form of the maximum cardinality matching problems in bipartite graphs,......
A signed (res. signed total) Roman dominating function, SRDF (res.STRDF) for short, of a graph G = (V; E) is a function ......
To address the problem that existing bipartite secret sharing scheme is short of dynamic characteristic, and to solve th......
