Parallel Graph Algorithms that Are Efficient on Average
Don CoppersmithPrabhakar RaghavanMartin TompaPublished in: FOCS (1987)
Keyphrases
- computationally efficient
- computationally expensive
- learning algorithm
- parallel architectures
- graph theory
- computationally complex
- data structure
- worst case
- optimization problems
- theoretical analysis
- depth first search
- efficient implementation
- parallel implementations
- partitioning algorithm
- parallel execution
- graph construction
- graph theoretic
- highly efficient
- computational cost
- query processing
- clustering algorithm