Results 291 to 300 of about 1,017,247 (314)
Some of the next articles are maybe not open access.
Bipartite Graphs and Coverings
2011In many real world applications, data are organized by coverings, instead of partitions. Covering-based rough sets have been proposed to cope with this type of data. Covering-based rough set theory is more general than rough set theory, then there is a need to employ sophisticated theories to make it more adaptive to applications.
Shiping Wang +2 more
openaire +1 more source
A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
Scandinavian Workshop on Algorithm Theory, 1971J. Hopcroft, R. Karp
semanticscholar +1 more source
Finite-time and fixed-time bipartite synchronization of complex networks with signed graphs
Mathematics and Computers in Simulation, 2021Wanli Zhang +3 more
semanticscholar +1 more source
Choosability of bipartite graphs
Ars Comb., 1996A graph is called \(k\)-choosable if for any assignment of lists of size at least \(k\) to the vertices, it is possible to properly color the graph so that every vertex receives a color from its list. Let \(n(k)\) be the smallest number of vertices of a bipartite non-\(k\)-choosable graph. It was proved by \textit{P. Erdős, A. L. Rubin}, and \textit{H.
Denis Hanson +2 more
openaire +1 more source
Oriented bipartite graphs with minimal trace norm
, 2019Juan Monsalve, J. Rada
semanticscholar +1 more source
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
SIAM Journal on Computing, 1973John E Hopcroft, Richard M Karp
exaly
Weakly bipartite graphs and the Max-cut problem
Operations Research Letters, 1981M Grötschel, W R Pulleyblank
exaly
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
Computational and Mathematical Organization Theory, 2004Garry Robins, Robins Garry
exaly
On maximum induced matchings in bipartite graphs
Information Processing Letters, 2002Vadim V Lozin
exaly