language-icon Old Web
English
Sign In
Acemap > Paper > Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs.

Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs.

2019 
Keywords:
    • Correction
    • Cite
    • Save
    • Machine Reading By IdeaReader
    32
    References
    0
    Citations
    NaN
    KQI
    []
    logo
    • CCF Conference Analysis
    • Map Galaxy
    • What's New
    © Copyright 2015-2020 Acemap, Inc. Shanghai Jiao Tong University.