Keywords

#maximally_matchable_edge

Maximally matchable edge

In graph theory, a maximally matchable edge in a graph is an edge that is included in at least one maximum-cardinality matching in the graph. An alternative term is allowed edge.

Sat 22nd

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Maximally matchable edge Matching (graph theory) Maximal independent set Edge detection Maximal subgroup Canny edge detector Maximally stable extremal regions Planar graph Line of purples Clique problem
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.