A polynomial-time algorithm matches two correlated stochastic block models of logarithmic average degree almost exactly for s^2 > 0.338, and exactly whenever s^2(a+b)/2 > 1.
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Efficient Graph Matching for Correlated Stochastic Block Models
A polynomial-time algorithm matches two correlated stochastic block models of logarithmic average degree almost exactly for s^2 > 0.338, and exactly whenever s^2(a+b)/2 > 1.