Pages that link to "Item:Q2704465"
From MaRDI portal
The following pages link to Designing efficient parallel algorithms on interval graphs (Q2704465):
Displaying 7 items.
- Highly parallelizable problems on sorted intervals (Q673932) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- New sequential and parallel algorithms for interval graph recognition (Q922725) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
- Optimal parallel algorithm for shortest-paths problem on interval graphs (Q3366282) (← links)
- Parallel computation on interval graphs: algorithms and experiments (Q4790934) (← links)