Aligning random graphs with a sub-tree similarity message-passing algorithm (Q5093855): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient random graph matching via degree profiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ?(2) limit in the random assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community Detection and Stochastic Block Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Belief propagation, robust reconstruction and optimal recovery of block models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymmetry of random regular graphs and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seeded graph matching via large neighborhood statistics / rank
 
Normal rank

Revision as of 19:28, 29 July 2024

scientific article; zbMATH DE number 7565686
Language Label Description Also known as
English
Aligning random graphs with a sub-tree similarity message-passing algorithm
scientific article; zbMATH DE number 7565686

    Statements

    Identifiers