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 this page instead for the normal view: An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs |
scientific article; zbMATH DE number 984690
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
