On the distributed complexity of computing maximal matchings

被引：4
|
作者：
Han´ćkowiak, Michal [1 ]
Karon´ski, Michal [1 ,2 ]
Panconesi, Alessandro [3 ]
机构：
[1] Department of Mathematics, Adam Mickiewicz University, Poznan´, Poland
[2] Department of Mathematics, Emory University, Atlanta, GA, United States
[3] DSI, La Sapienza, via Salaria 113, 00198 Roma, Italy
来源：
SIAM Journal on Discrete Mathematics | 2001年 / 15卷 / 01期
关键词：
Algorithms - Computational complexity - Computer architecture - Distributed computer systems - Graph theory - Mathematical models - Random access storage;
D O I：
10.1137/S0895480100373121
中图分类号：
学科分类号：
摘要：
We show that maximal matchings can be computed deterministically in O(log4 n) rounds in the synchronous, message-passing model of computation. This is one of the very few cases known of a nontrivial graph structure, and the only classical one, which can be computed distributively in polylogarithmic time without recourse to randomization.
引用
收藏
页码：41 / 57
相关论文
共 50 条
  • [21] Lower Bounds for Maximal Matchings and Maximal Independent Sets
    Balliu, Alkida
    Brandt, Sebastian
    Hirvonen, Juho
    Olivetti, Dennis
    Rabie, Mikael
    Suomela, Jukka
    JOURNAL OF THE ACM, 2021, 68 (05)
  • [22] MAXIMAL MATCHINGS IN GRAPHS WITH GIVEN MINIMAL AND MAXIMAL DEGREES
    BOLLOBAS, B
    ELDRIDGE, SE
    MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1976, 79 (MAR) : 221 - 234
  • [23] Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness
    Nasre, Meghana
    Nimbhorkar, Prajakta
    Pulath, Nada
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 244 - 257
  • [24] The average size of maximal matchings in graphs
    Alain Hertz
    Sébastien Bonte
    Gauvain Devillez
    Hadrien Mélot
    Journal of Combinatorial Optimization, 2024, 47
  • [25] Minimum Maximal Matchings in Cubic Graphs
    van Batenburg, Wouter Cames
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (02):
  • [26] MAXIMAL MATCHINGS IN POLYSPIRO AND BENZENOID CHAINS
    Doslic, Tomislav
    Short, Taylor
    APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2021, 15 (01) : 179 - 200
  • [27] Counting maximal matchings in linear polymers
    Doslic, Tomislav
    Zubac, Ivana
    ARS MATHEMATICA CONTEMPORANEA, 2016, 11 (02) : 255 - 276
  • [28] Complexity results for rainbow matchings
    Le, Van Bang
    Pfender, Florian
    THEORETICAL COMPUTER SCIENCE, 2014, 524 : 27 - 33
  • [29] Small maximal matchings in random graphs
    Zito, M
    THEORETICAL COMPUTER SCIENCE, 2003, 297 (1-3) : 487 - 507
  • [30] The average size of maximal matchings in graphs
    Hertz, Alain
    Bonte, Sebastien
    Devillez, Gauvain
    Melot, Hadrien
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (03)
12345