Pages that link to "Item:Q4359285"
From MaRDI portal
The following pages link to Parallel algorithms on interval graphs (Q4359285):
Displaying 8 items.
- Highly parallelizable problems on sorted intervals (Q673932) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs (Q1198065) (← links)
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs (Q1313714) (← links)
- Parallel algorithms for connectivity problems on interval graphs (Q1350233) (← links)
- Designing efficient parallel algorithms on interval graphs (Q2704465) (← links)
- Parallel computation on interval graphs: algorithms and experiments (Q4790934) (← links)
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← links)