Pages that link to "Item:Q671937"
From MaRDI portal
The following pages link to An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937):
Displaying 7 items.
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- An optimal PRAM algorithm for a spanning tree on trapezoid graphs. (Q1432796) (← links)
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs (Q1864209) (← links)
- (Q4376766) (← links)
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318) (← links)