Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems |
scientific article; zbMATH DE number 33308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems |
scientific article; zbMATH DE number 33308 |
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
