A fast and simple randomized parallel algorithm for maximal matching
Information Processing Letters
Constructing a perfect matching is in random NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Approximating matchings in parallel
Information Processing Letters
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient distributed weighted matchings on trees
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Bipartite Graph Matching Computation on GPU
EMMCVPR '09 Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
IEEE/ACM Transactions on Networking (TON)
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
Theoretical Computer Science
Maintaining a large matching and a small vertex cover
Proceedings of the forty-second ACM symposium on Theory of computing
Distributed fractional packing and maximum weighted b-matching via tail-recursive duality
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Dynamic approximate vertex cover and maximum matching
Property testing
Dynamic approximate vertex cover and maximum matching
Property testing
Video surveillance with PTZ cameras: the problem of maximizing effective monitoring time
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Adaptive distributed b-matching in overlays with preferences
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Controller and estimator for dynamic networks
Information and Computation
| Hi-index | 0.00 |
We consider distributed algorithms for approximate maximum matching on general graphs. Our main result is a randomized (4 + ε)-approximation distributed algorithm for weighted maximum matching, whose running time is O(log n) for any constant ε 0, where n is the number of nodes in the graph. In addition, we consider the dynamic case, where nodes are inserted and deleted one at a time. For unweighted dynamic graphs, we give an algorithm that maintains a (1 + ε)-approximation in O(1/ε) time for each node insertion or deletion. For weighted dynamic graphs we give a constant-factor approximation algorithm that runs in constant time for each insertion or deletion.