Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

doi 10.1145/2896377.2901460
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

Performance Evaluation Review
HardwareComputer NetworksSoftwareArchitectureCommunications
2016English

Improved Approximation Bounds for Planar Point Pattern Matching

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2007English

Bounds for Laplacian Graph Eigenvalues

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2012English

Structural Graph Matching With Polynomial Bounds on Memory and on Worst-Case Effort

2004English

Graph Matching for Object Recognition and Recovery

Pattern Recognition
Signal ProcessingComputer VisionPattern RecognitionArtificial IntelligenceSoftware
2004English

Improved Bounds for Centered Colorings

2020English

Improved Bounds for Wireless Localization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Resolution Lower Bounds for Perfect Matching Principles

English

Improved Bounds for Stein's Square Functions

Proceedings of the London Mathematical Society
Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy