scientific article; zbMATH DE number 7626795
From MaRDI portal
Publication:5053318
Xiaojun Lin, Liren Yu, Jiaming Xu
Publication date: 6 December 2022
Full work available at URL: https://arxiv.org/abs/2004.03816
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Bootstrap percolation on the random graph \(G_{n,p}\)
- Efficient random graph matching via degree profiles
- On convex relaxation of graph isomorphism
- Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels
- Powers of tensors and fast matrix multiplication
- An eigendecomposition approach to weighted graph matching problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- On spectral properties for graph matching and graph isomorphism problems
- Large deviations for sums of partly dependent random variables
- Settling the Sharp Reconstruction Thresholds of Random Graph Matching
- Seeded graph matching via large neighborhood statistics
- Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs
- Concentration of Measure for the Analysis of Randomized Algorithms
- Sinkhorn Algorithm for Lifted Assignment Problems
This page was built for publication:
