Pages that link to "Item:Q4613230"
From MaRDI portal
The following pages link to Graph Matching Based on Stochastic Perturbation (Q4613230):
Displaying 8 items.
- Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs (Q136800) (← links)
- Inexact graph matching using a hierarchy of matching processes (Q2288126) (← links)
- On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching (Q2834517) (← links)
- (Q4786059) (← links)
- Graph matching with hierarchical discrete relaxation (Q4934137) (← links)
- (Q5053318) (← links)
- Seeded graph matching via large neighborhood statistics (Q5136925) (← links)
- Information Recovery in Shuffled Graphs via Graph Matching (Q5375511) (← links)