Congested Clique Algorithms for the Minimum Cut Problem (Q5197700): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3212734.3212750 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2810492404 / rank | |||
Normal rank | |||
Latest revision as of 20:15, 19 March 2024
scientific article; zbMATH DE number 7107159
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Congested Clique Algorithms for the Minimum Cut Problem |
scientific article; zbMATH DE number 7107159 |
Statements
Congested Clique Algorithms for the Minimum Cut Problem (English)
0 references
19 September 2019
0 references
approximation algorithms
0 references
congested clique
0 references
minimum cut
0 references
