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.
2017
2017
Bit-Level Probabilistically Shaped Coded Modulation
A routine to parallelize and increase the throughput of fixed length distribution matching with non-binary output alphabet is… 
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… 
Highly Cited
2010
Highly Cited
2010
Ranking BPEL Processes for Service Discovery
Finding useful services is a challenging and important task in several applications. Current approaches for services retrieval… 
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… 
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
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
1982
Highly Cited
1982
Some facets of the simple plant location polytope
We relate the simple plant location problem to the vertex packing problem and derive several classes of facets of their… 
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)