# Matching (graph theory)

## Papers overview

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

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

2003

Highly Cited

2003

- Shape Modeling International.
- 2003

We describe a novel method for searching and comparing 3D objects. The method encodes the geometric and topological information… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Proceedings 18th International Conference on Data…
- 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

2002

Highly Cited

2002

- IEEE International Conference on Data Mining…
- 2002

We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called… (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

1987

Highly Cited

1987

- Combinatorica
- 1987

We present a new algorithm for finding a maximum matching in a general graph. The special feature of our algorithm is that its… (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- 21st Annual Symposium on Foundations of Computer…
- 1980

In this paper we present an 0(√|V|¿|E|) algorithm for finding a maximum matching in general graphs. This algorithm works in… (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?

Highly Cited

1965

Highly Cited

1965

- 1965

An algorithm is described for optimally pamng a finit e set of objects. That is, given a real numerical weight for each unordered… (More)

Is this relevant?