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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A routine to parallelize and increase the throughput of fixed length distribution matching with non-binary output alphabet is… 
2011
2011
A deep analysis of bi- and plano-concave lens made of stacked subwavelength hole arrays in terms of focus and angular power… 
Highly Cited
2010
Highly Cited
2010
Finding useful services is a challenging and important task in several applications. Current approaches for services retrieval… 
Highly Cited
2009
Highly Cited
2009
Finding an image from a large set of images is an extremely difficult problem. One solution is to label images manually, but this… 
Highly Cited
2006
Highly Cited
2006
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is… 
Highly Cited
2003
Highly Cited
2003
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
1998
Highly Cited
1998
In the standard version of the Self-Organizing Map, each neuron is associated with a vector. An extension using trees instead of… 
1998
1998
Case retrieval is a complex and important stage of the overall CBR process, involving situation assessment and a flexible… 
Highly Cited
1982
Highly Cited
1982
We relate the simple plant location problem to the vertex packing problem and derive several classes of facets of their…