An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(95)00125-v / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009278168 / rank | |||
Normal rank | |||
Latest revision as of 11:51, 30 July 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
0 references
