scientific article; zbMATH DE number 1303560

zbMath0930.68167MaRDI QIDQ4250185

Michał Karoński, Alessandro Panconesi, Michał Hanćkowiak

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hypercubeoblivious routingdistributed graph algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

NC Algorithms for Weighted Planar Perfect Matching and Related Problems ⋮ Improved deterministic distributed matching via rounding ⋮ Linear-in-\(\varDelta \) lower bounds in the LOCAL model ⋮ A two-stage hardware scheduler combining greedy and optimal scheduling ⋮ Almost stable matchings by truncating the Gale-Shapley algorithm ⋮ Local approximability of max-min and min-max linear programs ⋮ A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks ⋮ A simple local 3-approximation algorithm for vertex cover ⋮ Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers ⋮ On the distributed complexity of the semi-matching problem ⋮ Distributed Approximate Maximum Matching in the CONGEST Model. ⋮ Brief Announcement: Distributed Approximations for the Semi-matching Problem ⋮ When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time

This page was built for publication: