scientific article; zbMATH DE number 1303560
From MaRDI portal
Publication:4250185
zbMATH Open0930.68167MaRDI QIDQ4250185FDOQ4250185
Authors: Michal Karonski, Alessandro Panconesi, Michal Hanckowiak 
Publication date: 17 June 1999
Title of this publication is not available (Why is that?)
Recommendations
- On the distributed complexity of computing maximal matchings
- Distributed algorithm for approximating the maximum matching
- Distributed Algorithm for Better Approximation of the Maximum Matching
- An efficient distributed algorithm for maximum matching in general graphs
- On the distributed complexity of the semi-matching problem
- Algorithms – ESA 2004
- Distributed approximation of maximum independent set and maximum matching
- Distributed local approximation algorithms for maximum matching in graphs and hypergraphs
- Distributed algorithms for matching in hypergraphs
- Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs
Cited In (21)
- Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks
- Fast and simple local algorithms for 2-edge dominating sets and 3-total vertex covers
- A two-stage hardware scheduler combining greedy and optimal scheduling
- A simple local 3-approximation algorithm for vertex cover
- Title not available (Why is that?)
- Distributed maximum maintenance on hierarchically divided graphs
- On the distributed complexity of the semi-matching problem
- Distributed approximation for \(f\)-matching
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
- Almost stable matchings by truncating the Gale-Shapley algorithm
- Title not available (Why is that?)
- Brief announcement: Distributed approximations for the semi-matching problem
- NC algorithms for weighted planar perfect matching and related problems
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model
- Local approximability of max-min and min-max linear programs
- Brief announcement: Efficient load-balancing through distributed token dropping
- Distributed maximum matching verification in CONGEST
- Distributed approximate maximum matching in the CONGEST model
- Improved deterministic distributed matching via rounding
- Distributed Algorithm for Better Approximation of the Maximum Matching
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250185)
