Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,762,106 papers from all fields of science
Search
Sign In
Create Free Account
Matching (graph theory)
Known as:
Matched vertex
, Matching (graph)
, Complete matching
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
3-dimensional matching
Berge's lemma
Bidirected graph
Clique cover
Expand
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
Marcin Pikus
,
Wen Xu
IEEE Communications Letters
2017
Corpus ID: 30848845
A routine to parallelize and increase the throughput of fixed length distribution matching with non-binary output alphabet is…
Expand
2011
2011
Beamforming by Left-Handed Extraordinary Transmission Metamaterial Bi- and Plano-Concave Lens at Millimeter-Waves
M. Navarro‐Cía
,
M. Beruete
,
I. Campillo
,
M. S. Ayza
IEEE Transactions on Antennas and Propagation
2011
Corpus ID: 19155900
A deep analysis of bi- and plano-concave lens made of stacked subwavelength hole arrays in terms of focus and angular power…
Expand
Highly Cited
2010
Highly Cited
2010
Ranking BPEL Processes for Service Discovery
Daniela Grigori
,
J. Corrales
,
M. Bouzeghoub
,
A. Gater
IEEE Transactions on Services Computing
2010
Corpus ID: 15713650
Finding useful services is a challenging and important task in several applications. Current approaches for services retrieval…
Expand
Highly Cited
2009
Highly Cited
2009
A new approach in content-based image retrieval using fuzzy
Heba Aboulmagd
,
N. E. Gayar
,
H. Onsi
Telecommunications Systems
2009
Corpus ID: 15377613
Finding an image from a large set of images is an extremely difficult problem. One solution is to label images manually, but this…
Expand
Highly Cited
2006
Highly Cited
2006
Queue proportional scheduling via geometric programming in fading broadcast channels
Kibeom Seong
,
R. Narasimhan
,
J. Cioffi
IEEE Journal on Selected Areas in Communications
2006
Corpus ID: 12937331
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is…
Expand
Highly Cited
2003
Highly Cited
2003
Compact antenna structures for mobile handsets
J. Villanen
,
J. Ollikainen
,
O. Kivekas
,
P. Vainikainen
IEEE 58th Vehicular Technology Conference. VTC…
2003
Corpus ID: 62027782
In this paper, novel compact antenna structures for mobile handsets are studied. The antennas are based on non-resonant coupling…
Expand
Highly Cited
2001
Highly Cited
2001
A hybrid method for recognition of undercut features from moulded parts
Ye Xian Gao
,
J. Fuh
,
Kim Seng Lee
Comput. Aided Des.
2001
Corpus ID: 2721895
Highly Cited
1998
Highly Cited
1998
The Self-Organizing Map of Trees
M. Peura
Neural Processing Letters
1998
Corpus ID: 9098698
In the standard version of the Self-Organizing Map, each neuron is associated with a vector. An extension using trees instead of…
Expand
1998
1998
Retrieval in a Prototype-Based Case Library: A Case Study in Diabetes Therapy Revision
R. Bellazzi
,
S. Montani
,
L. Portinale
EWCBR
1998
Corpus ID: 8350198
Case retrieval is a complex and important stage of the overall CBR process, involving situation assessment and a flexible…
Expand
Highly Cited
1982
Highly Cited
1982
Some facets of the simple plant location polytope
G. Cornuéjols
,
J. Thizy
Mathematical programming
1982
Corpus ID: 33429267
We relate the simple plant location problem to the vertex packing problem and derive several classes of facets of their…
Expand
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)
ACCEPT & CONTINUE