An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 00:57, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs |
scientific article |
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
