Pages that link to "Item:Q1195857"
From MaRDI portal
The following pages link to An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857):
Displaying 6 items.
- Highly parallelizable problems on sorted intervals (Q673932) (← links)
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model' (Q3493247) (← links)
- Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model (Q3801099) (← links)