Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230): 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.1007/bf01293484 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094182335 / rank | |||
Normal rank | |||
Latest revision as of 10:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random parallel algorithms for finding exact branchings, perfect matchings, and cycles |
scientific article |
Statements
Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (English)
0 references
30 May 1995
0 references
exact problems
0 references
disjoint cycles
0 references
perfect matchings
0 references
randomized parallel algorithms
0 references
0 references
