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.
2010
2010
Multilayer Dual-Band Bandpass Filter in Low-Temperature Co-Fired Ceramic Substrate for Ultra-Wideband Applications
In this paper, we propose a new multilayer dual-band bandpass filter in a low-temperature co-fired ceramic (LTCC) substrate for… 
Highly Cited
2009
Highly Cited
2009
A new approach in content-based image retrieval using fuzzy
Finding an image from a large set of images is an extremely difficult problem. One solution is to label images manually, but this… 
2007
2007
Performance limits of greedy maximal matching in multi-hop wireless networks
In this paper, we characterize the performance limits of an important class of scheduling schemes, called greedy maximal matching… 
Highly Cited
2006
Highly Cited
2006
Queue proportional scheduling via geometric programming in fading broadcast channels
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is… 
Highly Cited
2003
Highly Cited
2003
Compact antenna structures for mobile handsets
In this paper, novel compact antenna structures for mobile handsets are studied. The antennas are based on non-resonant coupling… 
Highly Cited
2001
Highly Cited
2001
A hybrid method for recognition of undercut features from moulded parts
2001
2001
An implementable parallel scheduler for input-queued switches
The input-queued (IQ) switch architecture has received much attention in the research community and with implementers because it… 
Highly Cited
1998
Highly Cited
1998
The Self-Organizing Map of Trees
In the standard version of the Self-Organizing Map, each neuron is associated with a vector. An extension using trees instead of… 
Highly Cited
1989
Highly Cited
1989
Object recognition based on graph matching implemented by a Hopfield-style neural network
A model-based object recognition technique is presented. For each model, distinct features such as curvature points are extracted… 
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)