E. M. Badr (2011), A Parallel Computation of the Graph-Theoretic Version of the Union-Closed Sets Conjecture, 2nd International Conference on Mathematics and Information Science, Sohag, Egypt.
• 2011
Publication Information
Authors
E. M. Badr
Keywords
Not Available
Journal
Not Available
Publisher
Not Available
Volume
Not Available
Issue
Not Available
Pages
Not Available
publication.type
International
Paper Link
Open Link
Supplementary Materials
Not Available
Abstract
The aim of this paper is to present an experimental evaluation of a parallel derived subgraph algorithm PDSA using MPI. The performance of the algorithm PDSA is verified by computational experiments on some special graphs with different size, run in a cluster of workstations. MPI seems to be appropriate for these kind of experiments as the results are reliable and efficient.
Staff Members - Benha University