An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph.
Hillel GazitGary L. MillerPublished in: Inf. Process. Lett. (1988)
Keyphrases
- parallel algorithm
- directed graph
- random walk
- breadth first search
- parallel computation
- shared memory
- directed acyclic graph
- parallel programming
- graph structure
- search tree
- maximum flow
- strongly connected
- parallel version
- discovery of association rules
- depth first search
- binary search trees
- parallel implementations
- cluster of workstations
- undirected graph
- sensor networks
- orders of magnitude
- source node
- medial axis transform
- directed edges