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 条
  • [1] On the distributed complexity of computing maximal matchings
    Hanckowiak, M
    Karonski, M
    Panconesi, A
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2002, 15 (01) : 41 - 57
  • [2] On the Complexity of Minimum Maximal Acyclic Matchings
    Chaudhary, Juhi
    Mishra, Sounaka
    Panda, B. S.
    COMPUTING AND COMBINATORICS, COCOON 2022, 2022, 13595 : 106 - 117
  • [3] On the complexity of minimum maximal acyclic matchings
    Chaudhary, Juhi
    Mishra, Sounaka
    Panda, B. S.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 48 (01)
  • [4] Distributed Weighted Vertex Cover via Maximal Matchings
    Grandoni, Fabrizio
    Koenemann, Jochen
    Panconesi, Alessandro
    ACM TRANSACTIONS ON ALGORITHMS, 2008, 5 (01)
  • [5] Distributed weighted vertex cover via maximal matchings
    Grandoni, F
    Könemann, J
    Panconesi, A
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 839 - 848
  • [6] THE COMPLEXITY OF COMPUTING MAXIMAL WORD FUNCTIONS
    BRUSCHI, D
    PIGHIZZINI, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 157 - 167
  • [7] On the complexity of computing the Maximal Positive Invariant set
    Gheorghe, Bogdan
    Stoican, Florin
    Prodan, Ionela
    2024 EUROPEAN CONTROL CONFERENCE, ECC 2024, 2024, : 2697 - 2703
  • [8] Handling the Complexity of Computing Maximal Consistent Blocks
    Mroczek, Teresa
    ELECTRONICS, 2023, 12 (10)
  • [9] What is the complexity of a distributed computing system?
    Ranganathan, Anand
    Campbell, Roy H.
    COMPLEXITY, 2007, 12 (06) : 37 - 45
  • [10] Modeling complexity in secure distributed computing
    Cachin, C
    FUTURE DIRECTIONS IN DISTRIBUTED COMPUTING: RESEARCH AND POSITION PAPERS, 2003, 2584 : 57 - 61
12345