An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Deterministic parallel list ranking / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improvement on parallel computation of a maximal matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Fast Derandomization Scheme and Its Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved parallel algorithm for maximal matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4023519 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal parallel algorithm for maximal matching / rank | |||
Normal rank | |||
Revision as of 12:05, 4 June 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
