Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Matching (graph theory)

Known as: Matched vertex, Matching (graph), Complete matching 
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Feature matching is at the base of many computer vision problems, such as object recognition or structure from motion. Current… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper presents my work on computing shape models that are computationally fast and invariant basic transformations like… Expand
  • figure 4
  • figure 6
  • figure 7
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
This article presents a novel scale- and rotation-invariant detector and descriptor, coined SURF (Speeded-Up Robust Features… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The paper gives a snapshot of the state of the art in affine covariant region detectors, and compares their performance on a set… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We describe an approach to object and scene retrieval which searches for and localizes all the occurrences of a user outlined… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We describe a new method of matching statistical models of appearance to images. A set of model parameters control modes of shape… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Graph Theory: Introductory Concepts.- Trees.- Planarity.- Colorings.- Matchings.- Ramsey Theory.- References Combinatorics: Three… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • H. Bunke
  • IEEE Trans. Pattern Anal. Mach. Intell.
  • 1999
  • Corpus ID: 27017123
Investigates the influence of the cost function on the optimal match between two graphs. It is shown that, for a given cost… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Introduction to graph theory algorithmic techniques shortest paths trees and acyclic diagraphs depth first search connectivity… Expand
  • figure 1-2
  • figure 1-3
  • figure 1-4
  • figure 1-5
  • figure 1-6
Is this relevant?
Highly Cited
1965
Highly Cited
1965
An algorithm is described for optimally pamng a finit e set of objects. That is, given a real numerical weight for each unordered… Expand
Is this relevant?