238 search results - page 22 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...
SODA
2012
ACM
13 years 1 days ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
CCR
2004
14 years 9 months ago
2004
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...