The following pages link to Hillel Gazit (Q1111391):
Displayed 4 items.
- An improved parallel algorithm that computes the BFS numbering of a directed graph (Q1111392) (← links)
- (Q3679232) (← links)
- An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph (Q3985808) (← links)
- A Randomized Parallel Algorithm for Planar Graph Isomorphism (Q4209267) (← links)