Improving random walker segmentation using a nonlocal bipartite graph

2022 ◽  
Vol 71 ◽  
pp. 103154
Author(s):  
Linbo Wang ◽  
Meng Li ◽  
Xianyong Fang ◽  
Michele Nappi ◽  
Shaohua Wan
Keyword(s):  
Bipartite Graph ◽  
Random Walker

Graceful Labeling for Some Complete Bipartite Graph

2018 ◽  
Vol 9 (12) ◽  
pp. 2147-2152
Author(s):  
V. Raju ◽  
M. Paruvatha vathana
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Graceful Labeling

On the Crossing Number of $K_{m,n}$

10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.

scholarly journals Join Products K2,3 + Cn

Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 925
Author(s):  
Michal Staš
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number ◽  
Arithmetic Means ◽  
Minimum Number ◽  
Edge Crossings

The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete bipartite graph K 2 , 3 , where C n is the cycle on n vertices. In the proofs, the idea of a minimum number of crossings between two distinct configurations in the various forms of arithmetic means will be extended. Finally, adding one more edge to the graph K 2 , 3 , we also offer the crossing number of the join product of one other graph with the cycle C n .

scholarly journals Spectral Gap of the Largest Eigenvalue of the Normalized Graph Laplacian

2021 ◽  
Author(s):  
Jürgen Jost ◽  
Raffaella Mulas ◽  
Florentin Münch
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Spectral Gap ◽  
Complete Bipartite Graph ◽  
Graph Laplacian ◽  
New Method ◽  
Single Edge ◽  
Largest Eigenvalue ◽  
Complement Graph ◽  
The Largest Eigenvalue

AbstractWe offer a new method for proving that the maxima eigenvalue of the normalized graph Laplacian of a graph with n vertices is at least $$\frac{n+1}{n-1}$$ n + 1 n - 1 provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size $$\frac{n-1}{2}$$ n - 1 2 . With the same method, we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree, provided this is at most $$\frac{n-1}{2}$$ n - 1 2 .

scholarly journals GAGrank: Software for glycosaminoglycan sequence ranking using a bipartite graph model

2021 ◽  
pp. 100093
Author(s):  
John D. Hogan ◽  
Jiandong Wu ◽  
Joshua A. Klein ◽  
Cheng Lin ◽  
Luis Carvalho ◽  
...  
Keyword(s):  
Bipartite Graph ◽  
Graph Model

Geo-SPS: bipartite graph representation for GeoSpatial prenatal survey data

2021 ◽  
Author(s):  
Jie Cheng ◽  
Lu Lian ◽  
Zichen Xu ◽  
Dan Wu ◽  
Haoyang Zhu ◽  
...  
Keyword(s):  
Bipartite Graph ◽  
Survey Data ◽  
Graph Representation

scholarly journals Predicting Emergency Medical Service Demand With Bipartite Graph Convolutional Networks

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 9903-9915
Author(s):  
Ruidong Jin ◽  
Tianqi Xia ◽  
Xin Liu ◽  
Tsuyoshi Murata ◽  
Kyoung-Sook Kim
Keyword(s):  
Emergency Medical Service ◽  
Bipartite Graph ◽  
Medical Service ◽  
Service Demand ◽  
Convolutional Networks ◽  
Emergency Medical

scholarly journals Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks

2011 ◽  
Vol 2011 ◽  
pp. 1-20 ◽  
Author(s):  
M. Bouznif ◽  
R. Giroudeau
Keyword(s):  
Approximation Algorithm ◽  
Large Class ◽  
Bipartite Graph ◽  
Polynomial Time ◽  
Performance Guarantee ◽  
Makespan Minimization ◽  
Time Approximation ◽  
Polynomial Time Approximation Algorithm ◽  
Precedence Graph ◽  
Polynomial Time Approximation

We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors performing tasks. We then prove that there is no heuristic with a performance guarantee smaller than 4/3 for makespan minimization for precedence graph on a large class of processor networks like hypercube, grid, torus, and so forth, with a fixed diameter . We extend complexity results when the precedence graph is a bipartite graph. We also design an efficient polynomial-time -approximation algorithm for the makespan minimization on processor networks with diameter .

Sign in / Sign up

Export Citation Format

Share Document