Results 181 to 190 of about 92,446 (202)
Penalized GANs with latent perturbation for robust shilling attack generation in recommender systems. [PDF]
Discov ComputNawara D, Kashef R.
europepmc +1 more source
Entanglement distribution in lossy quantum networks. [PDF]
Sci RepOleynik L +3 more
europepmc +1 more source
Graph based link prediction for epilepsy drug discovery. [PDF]
Sci RepShi X +4 more
europepmc +1 more source
GRAPE: graph-regularized protein language modeling unlocks TCR-epitope binding specificity. [PDF]
Brief BioinformFu X +7 more
europepmc +1 more source
Neighbor-Enhanced Link Prediction in Bipartite Networks. [PDF]
Entropy (Basel)Cheng G +5 more
europepmc +1 more source
Multimodal graph neural networks in healthcare: a review of fusion strategies across biomedical domains. [PDF]
Front Artif IntellVaida M, Huang Z.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Complete (2,2) Bipartite Graphs
Malaysian Journal of Mathematical Sciences, 2022A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an extension of the above concept in which no two vertices in the same part are at distance two from each other.
Hanif, S., Bhat, K. A., Sudhakara, G.
openaire +1 more source
Physical Review Letters, 1987
Replica-symmetric solutions of the graph-bipartitioning problem with finite connectivity are presented. With the constraint ${sum}_{\mathrm{i}=1}^{\mathrm{N}}$${\mathrm{S}}_{\mathrm{i}}$=0 strictly enforced, another solution can be obtained, which gives a lower cost function than that given by the spin-glass solution.
openaire +2 more sources
Replica-symmetric solutions of the graph-bipartitioning problem with finite connectivity are presented. With the constraint ${sum}_{\mathrm{i}=1}^{\mathrm{N}}$${\mathrm{S}}_{\mathrm{i}}$=0 strictly enforced, another solution can be obtained, which gives a lower cost function than that given by the spin-glass solution.
openaire +2 more sources
Combinatorics, Probability and Computing, 1997
In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n=1, 2, [ctdot ], such that, for some constant c>0, the edges of Gn cannot be covered by n−c log n complete bipartite subgraphs of Gn. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.
Rödl, Vojtěch, Ruciński, Andrzej
openaire +1 more source
In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n=1, 2, [ctdot ], such that, for some constant c>0, the edges of Gn cannot be covered by n−c log n complete bipartite subgraphs of Gn. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.
Rödl, Vojtěch, Ruciński, Andrzej
openaire +1 more source
Maximal Energy Bipartite Graphs
Graphs and Combinatorics, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koolen, Jack H., Moulton, Vincent
openaire +3 more sources