A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs (Q1394096)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs |
scientific article; zbMATH DE number 3438290
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs |
scientific article; zbMATH DE number 3438290 |
Statements
A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs (English)
0 references
1974
0 references
