Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs.
Alan GibbonsWojciech RytterPublished in: FCT (1987)
Keyphrases
- parallel algorithm
- minimum spanning trees
- tree structured data
- parallel version
- parallel programming
- parallel computation
- optimal solution
- cluster of workstations
- weighted graph
- shared memory
- graph structure
- undirected graph
- combinatorial search problems
- parallel implementations
- minimum spanning tree
- spanning tree
- tree structure
- index structure
- search algorithm
- directed graph
- processor array
- edge detection