An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 984690
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs |
scientific article; zbMATH DE number 984690 |
Statements
An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (English)
0 references
27 February 1997
0 references
Parallel algorithms
0 references
Spanning tree
0 references
Permutation graphs
0 references
Graph theory
0 references
EREW computational model
0 references
0 references
0.8583246469497681
0 references
0.8425968289375305
0 references
0.8416476845741272
0 references
0.8415108919143677
0 references
0.8265856504440308
0 references
