Results 271 to 280 of about 1,017,247 (314)
Some of the next articles are maybe not open access.
On the Nullity of Bipartite Graphs
Graphs and Combinatorics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G R Omidi
exaly +3 more sources
Linear structure of bipartite permutation graphs and the longest path problem [PDF]
Information Processing Letters, 2007 The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bipartite permutation graph is proposed in this note.
Ryuhei Uehara, Gabriel Valiente
exaly +3 more sources
Contrastive Learning for Signed Bipartite Graphs
Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2023This paper is the first to use contrastive learning to improve the robustness of graph representation learning for signed bipartite graphs, which are commonly found in social networks, recommender systems, and paper review platforms. Existing contrastive
Zeyu Zhang +5 more
semanticscholar +1 more source
Distributed Approaches to Butterfly Analysis on Large Dynamic Bipartite Graphs
IEEE Transactions on Parallel and Distributed Systems, 2023Tip decomposition has a pivotal role in mining cohesive subgraphs in bipartite graphs by computing the tip number of each vertex in accordance with the non-trivial motif butterfly ((2,2)-biclique).
Tongfeng Weng +4 more
semanticscholar +1 more source
Co-Clustering on Bipartite Graphs for Robust Model Fitting
IEEE Transactions on Image Processing, 2022Recently, graph-based methods have been widely applied to model fitting. However, in these methods, association information is invariably lost when data points and model hypotheses are mapped to the graph domain.
Shuyuan Lin +4 more
semanticscholar +1 more source
Pareto-optimal Community Search on Large Bipartite Graphs
International Conference on Information and Knowledge Management, 2021In many real-world applications, bipartite graphs are naturally used to model relationships between two types of entities. Community discovery over bipartite graphs is a fundamental problem and has attracted much attention recently. However, all existing
Yuting Zhang +4 more
semanticscholar +1 more source
Physics Subject Headings (PhySH), 2022
A set of pairwise adjacent vertices in a graph is called a clique. A set of pairwise non-adjacent vertices in a graph is called an independent set. A graph G is bipartite if V (G) is the union of two independent sets of G. If these are disjoint, they are
R. Karp
semanticscholar +1 more source
A set of pairwise adjacent vertices in a graph is called a clique. A set of pairwise non-adjacent vertices in a graph is called an independent set. A graph G is bipartite if V (G) is the union of two independent sets of G. If these are disjoint, they are
R. Karp
semanticscholar +1 more source
IEEE Transactions on Network Science and Engineering, 2021
This work deals with the analysis and protocol design problems of the prescribed-time interval bipartite consensus of multi-agent systems on signed and directed graphs.
Xin Gong +4 more
semanticscholar +1 more source
This work deals with the analysis and protocol design problems of the prescribed-time interval bipartite consensus of multi-agent systems on signed and directed graphs.
Xin Gong +4 more
semanticscholar +1 more source
Combinatorics, Probability and Computing, 1997
In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n=1, 2, [ctdot ], such that, for some constant c>0, the edges of Gn cannot be covered by n−c log n complete bipartite subgraphs of Gn. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.
Vojtech Rödl, Andrzej Rucinski 0001
openaire +2 more sources
In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n=1, 2, [ctdot ], such that, for some constant c>0, the edges of Gn cannot be covered by n−c log n complete bipartite subgraphs of Gn. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.
Vojtech Rödl, Andrzej Rucinski 0001
openaire +2 more sources
A Bipartite Graph That Is Not the $γ$-Graph of a Bipartite Graph
2020For a graph $G = (V, E)$, the $γ$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $γ$-sets of $G$, and two $γ$-sets are adjacent if they differ by a single vertex and the two different vertices are adjacent in $G$.
openaire +1 more source