A Parallel Algorithm for Edge-Coloring of Graphs with Edge-Disjoint Cycles.
Eliezer A. AlbaceaPublished in: Inf. Process. Lett. (1992)
Keyphrases
- parallel algorithm
- spanning tree
- edge disjoint
- undirected graph
- weighted graph
- edge weights
- minimum cost
- total length
- parallel computation
- shared memory
- parallel programming
- binary search trees
- parallel implementations
- discovery of association rules
- cluster of workstations
- depth first search
- parallel version
- directed graph
- medial axis transform
- random walk