Amanote Research
Register
Sign In
Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
doi 10.1145/2896377.2901460
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2016
Authors
Daniel Cullina
Negar Kiyavash
Publisher
ACM Press
Related search
Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
Performance Evaluation Review
Hardware
Computer Networks
Software
Architecture
Communications
Improved Approximation Bounds for Planar Point Pattern Matching
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
Bounds for Laplacian Graph Eigenvalues
Mathematical Inequalities and Applications
Mathematics
Applied Mathematics
Structural Graph Matching With Polynomial Bounds on Memory and on Worst-Case Effort
Graph Matching for Object Recognition and Recovery
Pattern Recognition
Signal Processing
Computer Vision
Pattern Recognition
Artificial Intelligence
Software
Improved Bounds for Centered Colorings
A Simple Proof of the Erdos-Gallai Theorem on Graph Sequences
Bulletin of the Australian Mathematical Society
Mathematics
Improved Bounds for Wireless Localization
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Resolution Lower Bounds for Perfect Matching Principles
