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 条
  • [41] Dynamic Rank-Maximal Matchings
    Nimbhorkar, Prajakta
    Rameshwar, Arvind, V
    COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 433 - 444
  • [42] Computing Large Matchings Fast
    Rutter, Ignaz
    Wolff, Alexander
    PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 183 - +
  • [43] Computing Large Matchings Fast
    Rutter, Ignaz
    Wolff, Alexander
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 7 (01)
  • [44] Computing optimal Morse matchings
    Joswig, M
    Pfetsch, ME
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (01) : 11 - 25
  • [45] Small Maximal Matchings of Random Cubic Graphs
    Assiyatun, H.
    Duckworth, W.
    JOURNAL OF GRAPH THEORY, 2009, 62 (04) : 293 - 323
  • [46] Rank-maximal matchings - structure and algorithms
    Ghosal, Pratik
    Nasre, Meghana
    Nimbhorkar, Prajakta
    THEORETICAL COMPUTER SCIENCE, 2019, 767 : 73 - 82
  • [47] On total domination and minimum maximal matchings in graphs
    Bahadir, Selim
    QUAESTIONES MATHEMATICAE, 2023, 46 (06) : 1119 - 1129
  • [48] The dynamics of rank-maximal and popular matchings
    Ghosal P.
    Kunysz A.
    Paluch K.
    Theoretical Computer Science, 2023, 972
  • [49] Graphs with maximal induced matchings of the same size
    Baptiste, Philippe
    Kovalyov, Mikhail Y.
    Orlovich, Yury L.
    Werner, Frank
    Zverovich, Igor E.
    DISCRETE APPLIED MATHEMATICS, 2017, 216 : 15 - 28
  • [50] Dynamic rank-maximal and popular matchings
    Nimbhorkar, Prajakta
    Rameshwar, V. Arvind
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (02) : 523 - 545
12345