Efficient parallel algorithms for planar \(st\)-graphs (Q1400882)
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: Efficient parallel algorithms for planar \(st\)-graphs |
scientific article; zbMATH DE number 1964895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient parallel algorithms for planar \(st\)-graphs |
scientific article; zbMATH DE number 1964895 |
Statements
Efficient parallel algorithms for planar \(st\)-graphs (English)
0 references
17 August 2003
0 references
Algorithms
0 references
EREW PRAM
0 references
Merging
0 references
Multi-selection
0 references
Partitioning
0 references
Sorting
0 references
Parallel computing
0 references
