A Las Vegas RNC algorithm for maximum matching (Q1103637): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02579264 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011594074 / rank | |||
Normal rank | |||
Latest revision as of 08:30, 30 July 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
