A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Parallel computation on interval graphs using PC clusters: Algorithms and experiments
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
The use of PC clusters interconnected by high performance local networks is one of the major current trends in parallel/distributed computing. We give coarse-grained, BSP-like, parallel algorithms to solve many problems arising in the context of interval graphs, namely connected components, maximum weighted clique, BFS and DFS trees, minimum interval covering, maximum independent set and minimum dominating set. All of the described p-processor parallel algorithms require only constant or
doi:10.1007/bfb0057943
fatcat:2lltogfmgrelfpyvmlw22r2yhy