A parallel algorithm for eliminating cycles in undirected graphs (Q910243)
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 4139305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel algorithm for eliminating cycles in undirected graphs |
scientific article; zbMATH DE number 4139305 |
Statements
A parallel algorithm for eliminating cycles in undirected graphs (English)
0 references
1990
0 references
undirected graphs
0 references
Euler tour
0 references
parallel algorithm
0 references
cycles
0 references
CRCW PRAM
0 references
0.826438844203949
0 references
0.8173620700836182
0 references
0.8083751797676086
0 references
0.8074553608894348
0 references
