Finding maximum matching for bipartite graphs in parallel (Q1342094): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:25, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding maximum matching for bipartite graphs in parallel |
scientific article |
Statements
Finding maximum matching for bipartite graphs in parallel (English)
0 references
11 January 1995
0 references
parallel algorithm
0 references
maximum matching
0 references
bipartite graphs
0 references
