Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
3-dimensional matchingBerge's lemmaBidirected graphClique cover

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Beamforming by Left-Handed Extraordinary Transmission Metamaterial Bi- and Plano-Concave Lens at Millimeter-Waves
A deep analysis of bi- and plano-concave lens made of stacked subwavelength hole arrays in terms of focus and angular power… 
2011
2011
Design and implementation biometric access control system using fingerprint for restricted area based on gabor filter
Biometric recognition is the use of individual biometric characteristics, such as fingerprint, face, and signature for… 
Highly Cited
2010
Highly Cited
2010
Age invariant face recognition using graph matching
In this paper, we present a graph based face representation for efficient age invariant face recognition. The graph contains… 
2010
2010
TESLA: Translation Evaluation of Sentences with Linear-Programming-Based Analysis
We present TESLA-M and TESLA, two novel automatic machine translation evaluation metrics with state-of-the-art performances… 
2010
2010
Introducing Variability Rules in ATL for Managing Variability in MDE-based Product Lines
Various approaches show that software product lines can be implemented using the Model-Driven Engineering concept of successive… 
2009
2009
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web… 
2004
2004
Segmentation and Tracking of Multiple Moving Objects for Intelligent Video Analysis
This paper aims to address two of the key research issues in computer vision — the detection and tracking of multiple objects in… 
1994
1994
Optimal evolutionary tree comparison by sparse dynamic programming
In computational biology one is often interested in finding the concensus between different evolutionary trees for the same set… 
Highly Cited
1986
Highly Cited
1986
Parallel Algorithms for Computer Vision on the Connection Machine
The Connection Machine is a fine-grained parallel computer having up to 64K processors. It supports both local communication… 
Highly Cited
1981
Highly Cited
1981
Broadbanding:Gain equalization directly from data
This paper begins by presenting a powerful method which is easy to apply to many broad-band circuit design problems. Anyone with… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)