Conceptintro
Maximal matching
Also called inclusion-maximal matching.
A matching to which no edge can be added; found greedily and a 2-approximation for minimum vertex cover.
A matching to which no edge can be added; found greedily and a 2-approximation for minimum vertex cover.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag DEFDTW Edit this page History Report an error