Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

Performance Evaluation Review- United States

doi 10.1145/2964791.2901460

Full Text

Abstract

Available in

Categories

Computer Networks

Date

June 30, 2016

Authors

Publisher

Association for Computing Machinery (ACM)

Related search

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

English

Improved Approximation Bounds for Planar Point Pattern Matching

Applied Mathematics

Computer Science Applications

Computer Science

English

Bounds for Laplacian Graph Eigenvalues

Mathematical Inequalities and Applications

Applied Mathematics

Norwegian Nynorsk

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

English

Graph Matching for Object Recognition and Recovery

Pattern Recognition

Signal Processing

Computer Vision

Pattern Recognition

Artificial Intelligence

English

Improved Bounds for Centered Colorings

English

A Simple Proof of the Erdos-Gallai Theorem on Graph Sequences

Bulletin of the Australian Mathematical Society

English

Improved Bounds for Wireless Localization

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English

Resolution Lower Bounds for Perfect Matching Principles

English