Awake-Efficient Distributed Algorithms for Maximal Independent Set

被引：0
|
作者：
Hourani, Khalid [1 ]
Pandurangan, Gopal [1 ]
Robinson, Peter [2 ]
机构：
[1] University of Houston, Department of Computer Science, United States
[2] Augusta University, School of Computer and Cyber Sciences, United States
来源：
Proceedings - International Conference on Distributed Computing Systems | 2022年 / 2022-July卷
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Graph theory
引用
收藏
页码：1338 / 1339
相关论文
共 50 条
  • [1] Awake-Efficient Distributed Algorithms for Maximal Independent Set
    Hourani, Khalid
    Pandurangan, Gopal
    Robinson, Peter
    2022 IEEE 42ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2022), 2022, : 1338 - 1339
  • [2] Algorithms of maximal independent set
    Zhu, Songnian
    Zhu, Qiang
    Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University, 1995, 30 (04): : 473 - 479
  • [3] Optimal deterministic distributed algorithms for maximal independent set in geometric graphs
    Molla, Anisur Rahaman
    Pandit, Supantha
    Roy, Sasanka
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2019, 132 : 36 - 47
  • [4] Distributed Maximal Matching and Maximal Independent Set on Hypergraphs
    Balliu, Alkida
    Brandt, Sebastian
    Kuhn, Fabian
    Olivetti, Dennis
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 2632 - 2676
  • [5] Distributed-Memory Fast Maximal Independent Set
    Kanewala, Thejaka
    Zalewski, Marcin
    Lumsdaine, Andrew
    2017 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2017,
  • [6] Distributed maximal independent set on inhomogeneous random graphs
    Heydari, Hasan
    Taheri, S. Mahmoud
    2017 2ND CONFERENCE ON SWARM INTELLIGENCE AND EVOLUTIONARY COMPUTATION (CSIEC), 2017, : 77 - 82
  • [7] Distributed maximal independent set using small messages
    Ghaffari, Mohsen
    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, : 805 - 820
  • [8] Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
    Jeavons, Peter
    Scott, Alex
    Xu, Lei
    DISTRIBUTED COMPUTING, 2016, 29 (05) : 377 - 393
  • [9] Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
    Peter Jeavons
    Alex Scott
    Lei Xu
    Distributed Computing, 2016, 29 : 377 - 393
  • [10] Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph
    Chen, H
    Frieze, AM
    RANDOM STRUCTURES & ALGORITHMS, 1996, 9 (04) : 359 - 377
12345