FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL (Q4820169): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An 0(log n) parallel algorithm for strong connectivity augmentation problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Matrix and Graph Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distributed algorithms for finding centers and medians in networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel computation and conflicts in memory access / rank | |||
Normal rank | |||
Latest revision as of 14:31, 7 June 2024
scientific article; zbMATH DE number 2106752
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL |
scientific article; zbMATH DE number 2106752 |
Statements
FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL (English)
0 references
6 October 2004
0 references
