BabelNet

bn:03400472n

Noun Concept

Categories: Articles with short description, Computational problems in graph theory, Linear programming, Polynomial-time problems, Matching

matching

In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. Wikipedia

Definitions

Relations

Sources

In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. Wikipedia

A set of independent edges in a given graph, i.e. a set of edges which do not intersect, such that pairs of vertices are "matched" to each other one to one. Wiktionary

Graph theory: set of edges. Wiktionary (translation)

IS A

set

HAS KIND

rainbow matching

perfect matching

quadratic assignment problem

linear bottleneck assignment problem

generalized assignment problem

STUDIED BY

graph theory

Wikipedia