# Matching (graph theory)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Review

2016

Review

2016

- ICMR
- 2016

Graph matching, which refers to a class of computational problems of finding an optimal correspondence between the vertices of… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Image Vision Comput.
- 2009

In recent years, the use of graph based object representation has gained popularity. Simultaneously, graph edit distance emerged… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- ECCV
- 2008

In this paper we present a new approach for establishing corr espondences between sparse image features related by an unknown n… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- IEEE Transactions on Pattern Analysis and Machine…
- 2008

This paper proposes a novel graph matching algorithm and applies it to shape recognition based on object silhouettes. The main… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IJPRAI
- 2004

A recent paper posed the question: “Graph Matching: What are we really talking about?”. Far from providing a definite answer to… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Transactions on Pattern Analysis and Machine…
- 2004

We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- ICDE
- 2002

Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- IEEE Trans. Pattern Anal. Mach. Intell.
- 1996

A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- 1992

This is a course on matching theory and market design at the Ph.D. level. The course includes standard theoretical models of one… (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- SIAM J. Comput.
- 1973

The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of… (More)

Is this relevant?