We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover.
A short proof of König's matching theorem / Rizzi, Romeo. - ELETTRONICO. - (1999), pp. 1-1.
A short proof of König's matching theorem
Rizzi, Romeo
1999-01-01
Abstract
We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
tec54.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
150.82 kB
Formato
Adobe PDF
|
150.82 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
