Maximally matchable edge
id:
maximally-matchable-edge-282-7718104
title:
Maximally matchable edge
text:
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. A fundamental problem in matching theory is: given a graph G, find the set of all maximally matchable edges in G. This is equivalent to finding the union of all maximum matchings in G. Several algorithms for this problem are known.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Maximally_matchable_edge
date created:
date modified:
2023-04-22T23:23:25Z
main entity:
{"identifier":"Q97359764","url":"https://www.wikidata.org/entity/Q97359764"}
image:
fields total:
13
integrity:
13