Distributed algorithm for better approximation of the maximum matching

Andrzej Czygrinow; M. Hańćkowiak

doi:10.1007/3-540-45071-8_26

Distributed algorithm for better approximation of the maximum matching

Andrzej Czygrinow, M. Hańćkowiak

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

Abstract

Let G be a graph on n vertices that does not have odd cycles of lengths 3, ..., 2k - 1. We present an efficient distributed algorithm that finds in O(log^D n) steps (D = D(k)) matching M such that |M| ≥ (1 - α)|M*|, where M* is a maximum matching in G, α = 1/k+1.

Original language	English (US)
Pages (from-to)	242-251
Number of pages	10
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2697
DOIs	https://doi.org/10.1007/3-540-45071-8_26
State	Published - 2003

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-45071-8_26

Cite this

@article{5081ecbc9a224116a51c51500e8cad86,

title = "Distributed algorithm for better approximation of the maximum matching",

abstract = "Let G be a graph on n vertices that does not have odd cycles of lengths 3, ..., 2k - 1. We present an efficient distributed algorithm that finds in O(logD n) steps (D = D(k)) matching M such that |M| ≥ (1 - α)|M*|, where M* is a maximum matching in G, α = 1/k+1.",

author = "Andrzej Czygrinow and M. Ha{\'n}{\'c}kowiak",

year = "2003",

doi = "10.1007/3-540-45071-8_26",

language = "English (US)",

volume = "2697",

pages = "242--251",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - Distributed algorithm for better approximation of the maximum matching

AU - Czygrinow, Andrzej

AU - Hańćkowiak, M.

PY - 2003

Y1 - 2003

N2 - Let G be a graph on n vertices that does not have odd cycles of lengths 3, ..., 2k - 1. We present an efficient distributed algorithm that finds in O(logD n) steps (D = D(k)) matching M such that |M| ≥ (1 - α)|M*|, where M* is a maximum matching in G, α = 1/k+1.

AB - Let G be a graph on n vertices that does not have odd cycles of lengths 3, ..., 2k - 1. We present an efficient distributed algorithm that finds in O(logD n) steps (D = D(k)) matching M such that |M| ≥ (1 - α)|M*|, where M* is a maximum matching in G, α = 1/k+1.

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

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

U2 - 10.1007/3-540-45071-8_26

DO - 10.1007/3-540-45071-8_26

M3 - Article

AN - SCOPUS:33746089605

SN - 0302-9743

VL - 2697

SP - 242

EP - 251

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

Distributed algorithm for better approximation of the maximum matching

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this