An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs |
scientific article |
Statements
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (English)
0 references
25 July 2002
0 references
