Article

Free access

On the distributed complexity of computing maximal matchings

Authors:

Michał Hańćkowiak,

Michał Karoński,

Alessandro PanconesiAuthors Info & Claims

SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Pages 219 - 225

Published: 01 January 1998 Publication History

First page of PDF

References

[1]

'B. Awerbuch, A.V. Goldberg, M. Luby, and S. Plotkin, Network decomposition and locality in distributed computing, in Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS 1989), pages 364-369, IEEE, Research Triangle Park, North Carolina.

[2]

B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, Fast network decompositions, in Proceedings of the 1992 ACM Symposium on Principles of Distributed Computing (PODC 92), pp.169-177

Digital Library

[3]

N. Alon, J. Spencer, and P. Erd6s, The Probabilistic Method, Wiley-Interscience Series, John Wiley & Sons, Inc., New York, 1992.

[4]

B. Bollob~, Graph Theory, Springer Verlag, New York, 1979.

[5]

B. Bollob~, Chromatic number, girth, and maximal degree, Discrete Math. 24 (1978), 311-314.

[6]

S. Chaudhuri and D. Dubhashi, Probabilistic recurrence relations revisited, Theoretical computer Science, to appear.

Digital Library

[7]

A.V. Goldberg, S.A. Plotkin and G.E. Shannon, Parallel symmetry-breaking in sparse graphs, SIAM J. Disc. Math. Vol.1, No. 4, November 1988, pp. 434-446

Digital Library

[8]

D.A. Grable and A. Panconesi, Nearly optimal distributed edge colouring in O(log log n) rounds, Random Structures and Algorithms, 10(3):385-405, May 1997. Preliminary version in Proceedings of the Eight Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 97), New Orleans.

Digital Library

[9]

A. Israeli and Y. Shiloach, An improved algorithm for maximal matching, Information Processing Letters, 22(2):57-60, 18 January 1986

Digital Library

[10]

H.J. Karloff and D.B. Shmoys, Efficient parallel algorithms for edge coloring problems, J. Algorithms, 8 (1987), pp. 39-52

Digital Library

[11]

R. M. Karp, Probabilistic recurrence relations, in proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC 91), pages 190-197, New Orleans, Louisiana.

Digital Library

[12]

S. Kutten and D. Peleg, Fast distributed construction of k-dominating sets and applications, in Proceedings of the 1995 ACM Symposium on Principles of Distributed Computing (PODC 95), Ottawa, Ontario, pp. 238-249

Digital Library

[13]

N. Lynch, Distributed Algorithms, Morgan-Kaufmann, San Francisco.

Digital Library

[14]

N. Linial, Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193-201, February 1992.

Digital Library

[15]

N. Linial and M. Saks, Low diameter graph decomposition, Combinatorica (1993), Vol. 13 (4)

[16]

M. Luby, A simple parallel algorithm for the maximal independent set problem. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC 85), pages 1-10, Providence, Rhode islands.

Digital Library

[17]

M. Luby, Removing randomness in parallel without processor penalty, Journal of Computer and System Sciences, 47(2):250-286, October 1993

Digital Library

[18]

R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.

Digital Library

[19]

Moni Naor, A lower bound on probabilistic algorithms for distributive ring coloring, SIAM J. Disc. Math., Vol. 4, No. 3, pp. 409-412, August 1991

[20]

M. Naor and L. Stockmeyer, What can be computed locally? SIAM Journal on Computing, 24(6):1259- 1277, December 1995.

Digital Library

[21]

(). Johansson, personal communication.

[22]

Alessandro Panconesi, Lecture Notes in Distributed Algorithms, Solution Sheet # 4. Available from the author. E-mail:ale~brics. dk

[23]

A. Panconesi and A. Srinivasan, The Local Nature of A-coloring and Its Algorithmic Applications, Combinatorica 15 (2) 1995, 255-280.

[24]

A. Panconesi and A. Srinivasan, On the complexity of Distributed Network Decomposition, Journal of Algorithms 20, 356-374 (1996).

Digital Library

Cited By

Ghaffari MChan T(2019)Distributed maximal independent set using small messagesProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310485(805-820)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310485
Ghaffari MSu HKlein P(2017)Distributed degree splitting, edge coloring, and orientationsProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039852(2505-2523)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039852
Czygrinow AHanćkowiak MSzymańska EWawrzyniak W(2016)On the distributed complexity of the semi-matching problemJournal of Computer and System Sciences10.1016/j.jcss.2016.05.00182:8(1251-1267)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1016/j.jcss.2016.05.001
Show More Cited By

Index Terms

On the distributed complexity of computing maximal matchings
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Rank-maximal matchings

Suppose that each member of a set A of applicants ranks a subset of a set P of posts in an order of preference, possibly involving ties. A matching is a set of (applicant, post) pairs such that each applicant and each post appears in at most one pair. A ...
Matchability and k-maximal matchings

We present a collection of new structural, algorithmic, and complexity results for matching problems of two types. The first problem involves the computation of k-maximal matchings, where a matching is k-maximal if it admits no augmenting path with @?2k ...
Rank-maximal matchings
SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Suppose that each member of a set A of applicants ranks a subset of a set P of posts in an order of preference, possibly involving ties. A matching is a set of (applicant, post) pairs such that each applicant and each post appears in at most one pair. A ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

January 1998

704 pages

ISBN:0898714109

Chairman:
Howard Karloff

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM: Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1998

Check for updates

Qualifiers

Article

Conference

SODA98

Sponsor:

SIGACT
SIAM

SODA98: 1998 Conference on Discrete Algorithms

January 25 - 27, 1998

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
397
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)4

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ghaffari MChan T(2019)Distributed maximal independent set using small messagesProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310485(805-820)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310485
Ghaffari MSu HKlein P(2017)Distributed degree splitting, edge coloring, and orientationsProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039852(2505-2523)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039852
Czygrinow AHanćkowiak MSzymańska EWawrzyniak W(2016)On the distributed complexity of the semi-matching problemJournal of Computer and System Sciences10.1016/j.jcss.2016.05.00182:8(1251-1267)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1016/j.jcss.2016.05.001
Feuilloley LHirvonen JSuomela J(2015)Locally Optimal Load BalancingProceedings of the 29th International Symposium on Distributed Computing - Volume 936310.1007/978-3-662-48653-5_36(544-558)Online publication date: 7-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-662-48653-5_36
Schmid SSuomela JFoster NSherwood R(2013)Exploiting locality in distributed SDN controlProceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking10.1145/2491185.2491198(121-126)Online publication date: 16-Aug-2013
https://dl.acm.org/doi/10.1145/2491185.2491198
Suomela J(2013)Survey of local algorithmsACM Computing Surveys10.1145/2431211.243122345:2(1-40)Online publication date: 12-Mar-2013
https://dl.acm.org/doi/10.1145/2431211.2431223
Hirvonen JSuomela JKowalski DPanconesi A(2012)Distributed maximal matchingProceedings of the 2012 ACM symposium on Principles of distributed computing10.1145/2332432.2332464(165-174)Online publication date: 16-Jul-2012
https://dl.acm.org/doi/10.1145/2332432.2332464
Czygrinow AHanćkowiak MSzymańska EWawrzyniak W(2012)Distributed 2-approximation algorithm for the semi-matching problemProceedings of the 26th international conference on Distributed Computing10.1007/978-3-642-33651-5_15(210-222)Online publication date: 16-Oct-2012
https://dl.acm.org/doi/10.1007/978-3-642-33651-5_15
Czygrinow AHanćkowiak MKrzywdzinski KSzymanska EWawrzyniak W(2011)Brief announcementProceedings of the 25th international conference on Distributed computing10.5555/2075029.2075053(200-201)Online publication date: 20-Sep-2011
https://dl.acm.org/doi/10.5555/2075029.2075053
Suomela JRicha AGuerraoui R(2010)Distributed algorithms for edge dominating setsProceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1835698.1835783(365-374)Online publication date: 25-Jul-2010
https://dl.acm.org/doi/10.1145/1835698.1835783
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents