238 search results - page 14 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
— In this paper we use fluid model techniques to establish two results concerning the throughput of data switches. For an input-queued switch (with no speedup) we show that a ma...
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
Parallel load balancing is studied for problems with certain bisection properties. A class of problems has bisectors if every problem p of weight wp in the class can be subdivided...
84
Voted
AINA
2009
IEEE
15 years 4 months ago
2009
IEEE
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
ISAAC
1998
Springer
15 years 1 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
127
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...