The following pages link to (Q4023519):
Displayed 7 items.
- A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
- An insight on PRAM computational bounds (Q287202) (← links)
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218) (← links)
- An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
- A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
- The complexity of the bootstraping percolation and other problems (Q393154) (← links)
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)