Results 51 to 60 of about 1,011,259 (278)
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
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
Unsupervised Optimized Bipartite Graph Embedding
IEEE Transactions on Knowledge and Data Engineering, 2021 Graph embedding is a widely used method for dimensionality reduction due to its computational effectiveness. The quality of the graph and the efficiency of graph construction will directly affect the performance and the efficiency of the graph embedding ...
Jianyong Zhu +3 more
semanticscholar +1 more source
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
Adversarial Bipartite Graph Learning for Video Domain Adaptation [PDF]
ACM Multimedia, 2020 Domain adaptation techniques, which focus on adapting models between distributionally different domains, are rarely explored in the video recognition area due to the significant spatial and temporal shifts across the source (i.e.
Yadan Luo +4 more
semanticscholar +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
Bipartite embedding of (p,q)-trees [PDF]
Opuscula Mathematica, 2006 A bipartite graph \(G=(L,R;E)\) where \(V(G)=L\cup R\), \(|L|=p\), \(|R| =q\) is called a \((p,q)\)-tree if \(|E(G)|=p+q-1\) and \(G\) has no cycles. A bipartite graph \(G=(L,R;E)\) is a subgraph of a bipartite graph \(H=(L',R';E')\) if \(L\subseteq L'\)
Beata Orchel
doaj
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
Cohen-macaulay bipartite graphs [PDF]
Archiv der Mathematik, 1997 Let \(G\) be a graph on the vertex set \(V=\{x_1, \dots, x_n\}\). Let \(k\) be a field and let \(R\) be the polynomial ring \(k[x_1, \dots, x_n]\). The graph ideal \(I(G)\), associated to \(G\), is the ideal of \(R\) generated by the set of square-free monomials \(x_ix_j\) so that \(x_i\) is adjacent to \(x_j\). The graph \(G\) is Cohen-Macaulay over \(
Estrada, Mario, Villarreal, Rafael H.
openaire +2 more sources