TY - GEN

T1 - Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs

AU - Czygrinow, Andrzej

AU - Hańćkowiak, Michał

AU - Szymańska, Edyta

PY - 2009/12/1

Y1 - 2009/12/1

N2 - We give a deterministic distributed approximation algorithm for the maximum matching problem in graphs of bounded arboricity. Specifically, given 0<ε<1 and a positive integer a, the algorithm finds a matching of size at least (1-ε)m(G), where m(G) is the size of the maximum matching in an n-vertex graph G with arboricity at most a. The algorithm runs in O(log * n) rounds in the message passing model and it is the first sublogarithmic algorithm for the problem on such a wide class of graphs. Moreover, the result implies that the known lower bound on the time complexity for a constant or polylogarithmic approximation does not hold for graphs of bounded arboricity.

AB - We give a deterministic distributed approximation algorithm for the maximum matching problem in graphs of bounded arboricity. Specifically, given 0<ε<1 and a positive integer a, the algorithm finds a matching of size at least (1-ε)m(G), where m(G) is the size of the maximum matching in an n-vertex graph G with arboricity at most a. The algorithm runs in O(log * n) rounds in the message passing model and it is the first sublogarithmic algorithm for the problem on such a wide class of graphs. Moreover, the result implies that the known lower bound on the time complexity for a constant or polylogarithmic approximation does not hold for graphs of bounded arboricity.

UR - http://www.scopus.com/inward/record.url?scp=75649085309&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=75649085309&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-10631-6_68

DO - 10.1007/978-3-642-10631-6_68

M3 - Conference contribution

AN - SCOPUS:75649085309

SN - 3642106307

SN - 9783642106309

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 668

EP - 678

BT - Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings

T2 - 20th International Symposium on Algorithms and Computation, ISAAC 2009

Y2 - 16 December 2009 through 18 December 2009

ER -