An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053)
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: An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs |
scientific article; zbMATH DE number 1771766
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs |
scientific article; zbMATH DE number 1771766 |
Statements
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (English)
0 references
25 July 2002
0 references
0 references
0.9455893
0 references
0.9333353
0 references
0.93086255
0 references
0 references
0.9249687
0 references
0.9226695
0 references
