Results 11 to 20 of about 1,011,259 (278)
Equimatchable Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2023 A graph is called equimatchable if all of its maximal matchings have the same size. Lesk et al. [Equi-matchable graphs, Graph Theory and Combinatorics (Academic Press, London, 1984) 239–254] has provided a characterization of equimatchable bipartite ...
Büyükçolak Yasemin +2 more
doaj +2 more sources
The Bipartite-Splittance of a Bipartite Graph
Discussiones Mathematicae Graph Theory, 2019 A bipartite-split graph is a bipartite graph whose vertex set can be partitioned into a complete bipartite set and an independent set. The bipartite- splittance of an arbitrary bipartite graph is the minimum number of edges to be added or removed in ...
Yin Jian-Hua, Guan Jing-Xin
doaj +2 more sources
A review of recommendation system research based on bipartite graph [PDF]
MATEC Web of Conferences, 2021 The interaction history between users and items is usually stored and displayed in the form of bipartite graphs. Neural network recommendation based on the user-item bipartite graph has a significant effect on alleviating the long-standing data ...
Wu Ziteng +3 more
doaj +1 more source
Multi-Robot Active Mapping via Neural Bipartite Graph Matching [PDF]
Computer Vision and Pattern Recognition, 2022 We study the problem of multi-robot active mapping, which aims for complete scene map construction in minimum time steps. The key to this problem lies in the goal position estimation to enable more efficient robot movements.
Kai Ye +7 more
semanticscholar +1 more source
Concatenating Bipartite Graphs
The Electronic Journal of Combinatorics, 2022 Let $x,y\in (0,1]$, and let $A,B,C$ be disjoint nonempty stable subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbours in $B$, and every vertex in $B$ has at least $y|C|$ neighbours in $C$, and there are no edges between $A,C$.
Chudnovsky, M +4 more
openaire +3 more sources
Bipartite Graph Reasoning GANs for Person Pose and Facial Image Synthesis [PDF]
International Journal of Computer Vision, 2022 We present a novel bipartite graph reasoning Generative Adversarial Network (BiGraphGAN) for two challenging tasks: person pose and facial image synthesis.
Hao Tang +3 more
semanticscholar +1 more source
Signed Bipartite Graph Neural Networks [PDF]
International Conference on Information and Knowledge Management, 2021 Signed networks are such social networks having both positive and negative links. A lot of theories and algorithms have been developed to model such networks (e.g., balance theory).
Junjie Huang +4 more
semanticscholar +1 more source
BIPARTITE STEINHAUS GRAPHS [PDF]
Taiwanese Journal of Mathematics, 1999 A Steinhaus matrix is a symmetric 0-1 matrix \([a_{i,j}]_{n\times n}\) such that \(a_{i,j}= 0\) for \(0\leq i\leq n-1\) and \(a_{i,j}\equiv (a_{i- 1,j-1}+ a_{i-1,j})\pmod 2\) for \(1\leq i\leq n-1\). A Steinhaus graph is a graph whose adjacency matrix is a Steinhaus matrix. In this paper Lee and Chang prove that if \(G\) is a Steinhaus graph of order \(
Lee, Yueh-Shin, Chang, G. J.
openaire +3 more sources
Packing bipartite graphs with covers of complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chalopin, Jérémie, Paulusma, Daniël
openaire +4 more sources
On bipartite‐mixed graphs [PDF]
Journal of Graph Theory, 2018 AbstractMixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this article, we consider the case where such graphs are bipartite. As main results, we show that in this context the Moore‐like bound is attained in the case of diameter , and that bipartite‐mixed graphs of diameter do not exist.
Dalfó Simó, Cristina +2 more
openaire +5 more sources