Results 31 to 40 of about 92,446 (202)
Bipartite Ramsey numbers involving stars, stripes and trees
Electronic Journal of Graph Theory and Applications, 2013 The Ramsey number R(m, n) is the smallest integer p such that any blue-red colouring of the edges of the complete graph Kp forces the appearance of a blue Km or a red Kn.
Michalis Christou +2 more
doaj +1 more source
Counting Independent Sets and Colorings on Random Regular Bipartite Graphs [PDF]
, 2019 We give a fully polynomial-time approximation scheme (FPTAS) to count the number of independent sets on almost every Delta-regular bipartite graph if Delta >= 53.
Liao, Chao +3 more
core +2 more sources
International Journal of Computer Mathematics: Computer Systems Theory, 2020 Given a bipartite graph G = ( X , Y , E ) , the bipartite dot product representation of G is a function f : X ∪ Y → R k and a positive threshold t such that for any x ∈ X and y ∈ Y , x y ∈ E if and...
Bailey, Sean, Brown, David E.
openaire +4 more sources
Network Structure Personalized Recommendation Method Based on Social Tag and Historical Price Curve [PDF]
Jisuanji gongcheng, 2017 Social tag contains rich content of commodity and reflects user’s personal preference for commodity.Historical price curve of commodity impacts user’s purchase-tendency.Therefore,this paper proposes a personalized recommendation method based on social ...
LING Xiao’e
doaj +1 more source
Edge-Coloring Bipartite Graphs [PDF]
Journal of Algorithms, 2000 This note provides an algorithm for finding \(\Delta\)(colors)-edge-coloring of a bipartite graph of order \(n\) and size \(m\) in time \(T+O(m\log \Delta)\) where \(T\) is the time needed to find a perfect matching in a \(k\)-regular bipartite graph, \(k\leq \Delta\), and \(\Delta\) is the maximum degree of vertices.
A. Kapoor, Rizzi, Romeo
openaire +3 more sources
Homomorphisms of infinite bipartite graphs onto complete bipartite graphs [PDF]
Czechoslovak Mathematical Journal, 1983 Let B be a bipartite graph on the vertex sets C, D. A homomorphism \(\phi\) of B onto a complete bipartite graph \(K_{r,s}\) is said to be bicomplete if \(\phi(x)=\phi(y)\) only if either both x, y belong to C, or both x, y belong to D. For a connected bipartite graph B, the author defines the parameter \(\beta_ 0(B)\) as the supremum of all values of ...
openaire +2 more sources
Decomposition of complete graphs into small graphs [PDF]
Opuscula Mathematica, 2010 In 1967, A. Rosa proved that if a bipartite graph \(G\) with \(n\) edges has an \(\alpha\)-labeling, then for any positive integer \(p\) the complete graph \(K_{2np+1}\) can be cyclically decomposed into copies of \(G\).
Dalibor Froncek
doaj +1 more source
BIPARTITE GRAPH ASSOCIATED WITH ELEMENTS AND COSETS OF SUBRINGS OF FINITE RINGS
Barekeng, 2023 Let be a finite ring. The bipartite graph associated to elements and cosets of subrings of is a simple undirected graph with vertex set , where is the set of all subrings of , and two vertices and are adjacent if and only if In this study, we ...
Hubbi Muhammad +3 more
doaj +1 more source
Detecting and generating overlapping nested communities
Applied Network Science, 2023 Nestedness has been observed in a variety of networks but has been primarily viewed in the context of bipartite networks. Numerous metrics quantify nestedness and some clustering methods identify fully nested parts of graphs, but all with similar ...
Imre Gera, András London
doaj +1 more source
Dynamic Load Balancing Algorithm Based on Optimal Matching of Weighted Bipartite Graph
IEEE Access, 2022 When the server cluster is processing concurrent task requests, if the performance difference among servers is not fully considered, task allocation will be unreasonable, which will lead to an increase in task making span and a decrease in cluster ...
Wei Hou +3 more
doaj +1 more source