An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Parallel Matrix and Graph Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast parallel sorting algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructing a perfect matching is in random NC / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New Parallel-Sorting Schemes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An O(n2log n) parallel max-flow algorithm / rank | |||
Normal rank |
Latest revision as of 10:49, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs |
scientific article |
Statements
An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (English)
0 references
1987
0 references
bipartite graphs
0 references
parallel algorithm
0 references
serial algorithm
0 references
computational complexity
0 references
matching
0 references
tree
0 references