Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90173-f / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012515371 / rank | |||
Normal rank | |||
Latest revision as of 09:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems |
scientific article |
Statements
Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (English)
0 references
28 June 1992
0 references
parallel complexity of matching
0 references
perfect matching
0 references
Las Vegas RNC algorithm
0 references
\(T\)-join problem
0 references
