A Las Vegas RNC algorithm for maximum matching (Q1103637): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Paths, Trees, and Flowers / 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: On the structure of factorizable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Min-max Relations for Directed Graphs / rank | |||
Normal rank |
Revision as of 16:31, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Las Vegas RNC algorithm for maximum matching |
scientific article |
Statements
A Las Vegas RNC algorithm for maximum matching (English)
0 references
1986
0 references
algorithms
0 references
maximum matching
0 references