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.
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… 
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… 
Highly Cited
2009
Highly Cited
2009
Assessment of the Relatedness of Equivalent Stimuli Through a Semantic Differential
If stimulus equivalence is a model of meaning, abstract stimuli should acquire the meaning of meaningful stimuli equivalent to… 
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
2001
Highly Cited
2001
A hybrid method for recognition of undercut features from moulded parts
Highly Cited
2001
Highly Cited
2001
Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms
We systematically design two new decomposition?recombination (DR) planners, geared to perform well with respect to several… 
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… 
1998
1998
Retrieval in a Prototype-Based Case Library: A Case Study in Diabetes Therapy Revision
Case retrieval is a complex and important stage of the overall CBR process, involving situation assessment and a flexible… 
Highly Cited
1991
Highly Cited
1991
Varieties of ignorance and the need for well-founded theories
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)