OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS (Q3130156): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4003441 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient parallel algorithms for bipartite permutation graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal merging and sorting on the EREW PRAM / rank | |||
Normal rank | |||
Latest revision as of 11:16, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS |
scientific article |
Statements
OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS (English)
0 references
22 April 1997
0 references
cost-optimal parallel algorithm
0 references
maximum matching problem
0 references
bipartite permutation graphs
0 references
0 references
