Results 211 to 220 of about 2,715,030 (252)

Online bipartite matching methodology for anti-epidemic resources allocation: an adaptive time window based on reinforcement learning. [PDF]

Front Public Health
Wu Z, Pang S, He S.
europepmc   +1 more source

Electric vehicle charging station recommendation system based on graph neural network and context-aware refinement. [PDF]

Sci Rep
Seo D, Moon J, Kwon HY.
europepmc   +1 more source

Robust Target Association Method with Weighted Bipartite Graph Optimal Matching in Multi-Sensor Fusion. [PDF]

Sensors (Basel)
Wu H, Chen W, Chen W.
europepmc   +1 more source

The maximum edge biclique problem is NP-complete. [PDF]

Peeters, M.J.P.
core  

Complete (2,2) Bipartite Graphs

Malaysian Journal of Mathematical Sciences, 2022
A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an extension of the above concept in which no two vertices in the same part are at distance two from each other.
Hanif, S., Bhat, K. A., Sudhakara, G.
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Complete bipartite graphs deleted in Ramsey graphs

Theoretical Computer Science, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ye Wang
exaly   +4 more sources

On the vulnerability of permutation graphs of complete and complete bipartite graphs

, 1991
The integrity of a graph \(G\) is defined as \(\min\{| S|+m(G-S)\}\) taken over all subsets \(S\) of \(V(G)\), where \(m(G-S)\) is the order of the largest component of \(G-S\). The toughness of \(G\) is defined as \(\min\{| S|/w(G-S)\}\) taken over all disconnecting subsets \(S\) of \(G\), where \(w(G-S)\) is the number of components of \(G-S\).
Guichard, D., Piazza, Barry L., Stueckle, Sam K.   +2 more
openaire   +2 more sources

Decomposition of complete graphs into isomorphic complete bipartite graphs

, 2013
Summary: A decomposition of a complete graph \(K\) into disjoint copies of a complete bipartite graph \(K_{s,t}\) is called a \(K_{s,t}\)-design of order \(n\). The existence problem of \(K_{s,t}\)-designs has been completely solved for the graphs \(K_{1,t}\) for \(k\geq 1\), \(K_{2^{a},2^{b}}\) for \(a,b\geq 1\), \(K_{2, 3}\) and \(K_{3, 3}\). In this
Kolotoglu, Emre
openaire   +4 more sources

Paintability of Complete Bipartite Graphs

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

On the Decomposition of Graphs into Complete Bipartite Graphs

Graphs and Combinatorics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinquan Dong, Yanpei Liu
openaire   +3 more sources