An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(00)00101-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095026547 / rank | |||
Normal rank | |||
Latest revision as of 12:09, 30 July 2024
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
