Sciweavers

33 search results - page 1 / 7
» Bipartite Graph Matchings in the Semi-streaming Model
Sort
View
ICPR
2010
IEEE
13 years 8 months ago
Cell Tracking in Video Microscopy Using Bipartite Graph Matching
Automated visual tracking of cells from video microscopy has many important biomedical applications. In this paper, we model the problem of cell tracking over pairs of video micro...
Ananda Chowdhury, Rohit Chatterjee, Mayukh Ghosh, ...
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
13 years 11 months ago
Bipartite Graph Matchings in the Semi-streaming Model
Sebastian Eggert, Lasse Kliemann, Anand Srivastav
IPPS
1999
IEEE
13 years 9 months ago
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne,...
JAL
2006
101views more  JAL 2006»
13 years 4 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
FOCS
2003
IEEE
13 years 10 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...