A fast distributed algorithm for approximating the maximum matching

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

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2/3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log4 |V(G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the running time of an algorithm proposed recently by the authors in [2].

Original languageEnglish (US)
Pages (from-to)252-263
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3221
StatePublished - 2004

Fingerprint

Maximum Matching
Distributed Algorithms
Parallel algorithms
Fast Algorithm
Models of Computation
Message passing
Approximation algorithms
Message Passing
Approximation Algorithms
Network protocols
Computing
Graph in graph theory

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{e8283f72e0074ebd8f6212bb480222e2,
title = "A fast distributed algorithm for approximating the maximum matching",
abstract = "We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2/3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log4 |V(G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the running time of an algorithm proposed recently by the authors in [2].",
author = "Andrzej Czygrinow and Michał Hańćkowiak and Edyta Szymańska",
year = "2004",
language = "English (US)",
volume = "3221",
pages = "252--263",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - A fast distributed algorithm for approximating the maximum matching

AU - Czygrinow, Andrzej

AU - Hańćkowiak, Michał

AU - Szymańska, Edyta

PY - 2004

Y1 - 2004

N2 - We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2/3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log4 |V(G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the running time of an algorithm proposed recently by the authors in [2].

AB - We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2/3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log4 |V(G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the running time of an algorithm proposed recently by the authors in [2].

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

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

M3 - Article

AN - SCOPUS:33746100365

VL - 3221

SP - 252

EP - 263

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -