588 search results - page 6 / 118 » A Fast Distributed Algorithm for Approximating the Maximum M... |
160
Voted
PODC
2010
ACM
15 years 6 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
115
click to vote
ICPP
1987
IEEE
15 years 5 months ago
1987
IEEE
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
154
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
126
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...