Algorithms – ESA 2004

DOI10.1007/b100428zbMath1111.68779OpenAlexW2483610301MaRDI QIDQ5464584

Edyta Szymańska, Andrzej Czygrinow, Michał Hanćkowiak

Publication date: 18 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (3)

Distributed algorithms for weighted problems in sparse graphs ⋮ Improved deterministic distributed matching via rounding ⋮ Distributed algorithms for covering, packing and maximum weighted matching

This page was built for publication: Algorithms – ESA 2004