Algorithms of maximal independent set

被引:0
|
作者
Zhu, Songnian
Zhu, Qiang
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:473 / 479
相关论文
共 50 条
  • [31] 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
  • [32] Distributed maximal independent set using small messages
    Ghaffari, Mohsen
    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, : 805 - 820
  • [33] Conversion of coloring algorithms into maximum weight independent set algorithms
    Erlebach, T
    Jansen, K
    DISCRETE APPLIED MATHEMATICS, 2005, 148 (01) : 107 - 125
  • [34] Approximation algorithms for the weighted independent set problem
    Kako, A
    Ono, T
    Hirata, T
    Halldórsson, MM
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 341 - 350
  • [35] Algorithms for the Independent Feedback Vertex Set Problem
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (06): : 1179 - 1188
  • [36] Fast Algorithms for MIN INDEPENDENT DOMINATING SET
    Bourgeois, Nicolas
    Escoffier, Bruno
    Paschos, Vangelis Th
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2010, 6058 : 247 - +
  • [37] Iterative quantum algorithms for maximum independent set
    Brady, Lucas T.
    Hadfield, Stuart
    PHYSICAL REVIEW A, 2024, 110 (05)
  • [38] Fast algorithms for MIN INDEPENDENT DOMINATING SET
    Bourgeois, N.
    Della Croce, F.
    Escoffier, B.
    Paschos, V. Th.
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (4-5) : 558 - 572
  • [39] Lower bounds for graph reconstruction with maximal independent set queries
    Michel, Lukas
    Scott, Alex
    THEORETICAL COMPUTER SCIENCE, 2025, 1034
  • [40] Derandomized concentration bounds for polynomials, and hypergraph maximal independent set
    Harris, David G.
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2161 - 2180