Partitioning graphs on message-passing machines by pairwise mincut (Q1818794)
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: Partitioning graphs on message-passing machines by pairwise mincut |
scientific article; zbMATH DE number 1384416
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning graphs on message-passing machines by pairwise mincut |
scientific article; zbMATH DE number 1384416 |
Statements
Partitioning graphs on message-passing machines by pairwise mincut (English)
0 references
4 January 2000
0 references
partitioning by pairwise mincut
0 references
massively parallel machines
0 references
0.9251574
0 references
0.9045577
0 references
0.9028285
0 references
0.8874967
0 references
0.88705313
0 references
0.8868507
0 references
0.88543665
0 references
