Results 261 to 270 of about 1,011,259 (278)

Cooperative Bipartite Containment Control for Heterogeneous Networks With Structurally Balanced Graph

IEEE Transactions on Circuits and Systems - II - Express Briefs, 2021
This brief investigates the bipartite containment control problem of linear multi-agent systems over signed directed graphs. Since the graph is structurally balanced and the definition of M-matrix that utilized in several previous is invalid in this ...
Yu Zhou, Hua-guang Zhang, Longfei Yu, Shaoxin Sun   +3 more
semanticscholar   +1 more source

Maximal Energy Bipartite Graphs

Graphs and Combinatorics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koolen, Jack H., Moulton, Vincent
openaire   +3 more sources

Weakly Supervised Segmentation with Maximum Bipartite Graph Matching

ACM Multimedia, 2020
In the weakly supervised segmentation task with only image-level labels, a common step in many existing algorithms is first to locate the image regions corresponding to each existing class with the Class Activation Maps (CAMs), and then generate the ...
Weide Liu, Chi Zhang, Guosheng Lin, Tzu-Yi Hung, C. Miao   +4 more
semanticscholar   +1 more source

Coverings of Bipartite Graphs

Canadian Journal of Mathematics, 1958
For the purpose of analysing bipartite graphs (hereinafter called simply graphs) the concept of an exterior covering is introduced. In terms of this concept it is possible in a natural way to decompose any graph into two parts, an inadmissible part and a core.
Dulmage, A. L., Mendelsohn, N. S.
openaire   +1 more source

Bipartite graphs as polynomials and polynomials as bipartite graphs

Journal of Algebra and Its Applications, 2020
The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial [Formula: see text], and any directed finite bipartite graph can be considered as a polynomial [Formula: see text], and vise verse. We also show that the multiplication in the semirings [Formula: see text], [Formula: see text] corresponds to an
Grinblat, Andrey, Lopatkin, Viktor
openaire   +2 more sources

Anomaly Detection on Dynamic Bipartite Graph with Burstiness

Industrial Conference on Data Mining, 2020
Many real-world network data can be modelled as a bipartite graph, such as client-server in the computer network and trader-stock in the stock market. Detecting anomalies on these graphs benefit many applications, e.g., network intrusion detection and ...
Zhe Chen, Aixin Sun
semanticscholar   +1 more source

BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE

Discrete Mathematics, Algorithms and Applications, 2010
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture has been verified for all graphs with at most 11 vertices. Further, the conjecture has been verified for regular graphs, trees, disconnected graphs, unit interval graphs, separable graphs with no pendant vertex, outer-planar graphs, and unicyclic graphs.
Kiyomi, Masashi, Saitoh, Toshiki, Uehara, Ryuhei   +2 more
openaire   +1 more source

Constructing Unstable Graphs from Bipartite Graphs

Bulletin of the Malaysian Mathematical Sciences Society
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haiyan Jiang, Junyang Zhang
openaire   +2 more sources

Packing two bipartite graphs into a complete bipartite graph

Journal of Graph Theory, 1997
A bipartite graph \(G\) admits an \((a,b)\)-bipartition if \(G\) has a bipartition \((X,Y)\) such that \(|X|=a\) and \(|Y|=b\). Two bipartite graphs \(G\) and \(H\) are compatible if, for some integers \(a\) and \(b\), both \(G\) and \(H\) admit an \((a,b)\)-bipartition. In the paper it is proved that any two compatible \(C_4\)-free bipartite graphs of
openaire   +2 more sources

Fast Semi-Supervised Learning With Optimal Bipartite Graph

IEEE Transactions on Knowledge and Data Engineering, 2021
Fang He, F. Nie, Rong Wang, Haojie Hu, Weimin Jia, Xuelong Li   +5 more
semanticscholar   +1 more source