Results 41 to 50 of about 1,017,247 (314)
Envy-free matchings in bipartite graphs and their applications to fair division [PDF]
Information Sciences, 2019 A matching in a bipartite graph $G:=(X + Y,E)$ is said to be envy-free if no unmatched vertex in $X$ is adjacent to a mathced vertex in $Y$. Every perfect matching is envy-free, but envy-free matchings may exist even when perfect matchings do not.
Elad Aigner-Horev, Erel Segal-Halevi
semanticscholar +1 more source
On bipartite divisor graph for character degrees [PDF]
International Journal of Group Theory, 2017 The concept of the bipartite divisor graph for integer subsets has been considered in [M. A. Iranmanesh and C. E. Praeger, Bipartite divisor graphs for integer subsets, Graphs Combin., 26 (2010) 95--105.].
Seyed Ali Moosavi
doaj +1 more source
Bipartite Domination in Graphs
Mathematica Pannonica, 2022 The bipartite domination number of a graph is the minimum size of a dominating set that induces a bipartite subgraph. In this paper we initiate the study of this parameter, especially bounds involving the order, the ordinary domination number, and the chromatic number.
Bachstein, Anna +2 more
openaire +2 more sources
Auto-weighted multi-view co-clustering with bipartite graphs
Information Sciences, 2020 Co-clustering aims to explore coherent patterns by simultaneously clustering samples and features of data. Several co-clustering methods have been proposed in the past decades.
Shudong Huang +3 more
semanticscholar +1 more source
Small bipartite subgraph polytopes [PDF]
, 2010 We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes.
Galli, L +6 more
core +1 more source
Bounds for the Kirchhoff Index of Bipartite Graphs
Journal of Applied Mathematics, 2012 A -bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has n vertices. The tree dumbbell consists of the path together with a independent vertices adjacent to one pendent vertex of and b independent ...
Yujun Yang
doaj +1 more source
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 We present an $\tilde{O}(m+n^{1.5})$-time randomized algorithm for maximum cardinality bipartite matching and related problems (e.g. transshipment, negative-weight shortest paths, and optimal transport) on m-edge, n-node graphs.
Jan van den Brand +7 more
semanticscholar +1 more source
Bipartite graphs and quasipositive surfaces [PDF]
, 2013 We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.
SEBASTIAN BAADER, Baader, Sebastian
core +1 more source
Advances in Materials Science and Engineering, 2023 The application of bipartite and regular graphs plays a vital role in the area of engineering, mathematical sciences, design of experiments, and medical fields.
P. Karthikeyan +4 more
doaj +1 more source
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source