Pages that link to "Item:Q910243"
From MaRDI portal
The following pages link to A parallel algorithm for eliminating cycles in undirected graphs (Q910243):
Displaying 4 items.
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346) (← links)
- An optimal PRAM algorithm for a spanning tree on trapezoid graphs. (Q1432796) (← links)
