Pages that link to "Item:Q673932"
From MaRDI portal
The following pages link to Highly parallelizable problems on sorted intervals (Q673932):
Displaying 5 items.
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
- Parallel algorithms for connectivity problems on interval graphs (Q1350233) (← links)
- Unified all-pairs shortest path algorithms in the chordal hierarchy (Q1364781) (← links)
- Tight Bounds on the Complexity of Parallel Sorting (Q3219774) (← links)
- PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS (Q5248988) (← links)