Google scholar arxiv informatics ads IJAIS publications are indexed with Google Scholar, NASA ADS, Informatics et. al.

Call for Paper

-

November Edition 2021
International Journal of Applied Information Systems solicits high quality original research papers for the November 2021 Edition of the journal. The last date of research paper submission is October 15, 2021.

Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm

E. M. Badr Published in Algorithms

Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm
International Journal of Applied Information Systems
Year of Publication: 2012
© 2012 by IJAIS Journal
Series Volume 4 Number 8
Authors E. M. Badr
10.5120/ijais12-450735
Download full text

  1. E M Badr. Article: Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm. International Journal of Applied Information Systems 4(8):1-6, December 2012. BibTeX

    @article{key:article,
	author = "E. M. Badr",
	title = "Article: Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm",
	journal = "International Journal of Applied Information Systems",
	year = 2012,
	volume = 4,
	number = 8,
	pages = "1-6",
	month = "December",
	note = "Published by Foundation of Computer Science, New York, USA"
}

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.

Reference

  1. I. Rival (Ed. ), Graphs And Order, Reidel, Dordrecht-Boston,(1985), p. 25.
  2. R. P. Stanley, Enumerative Combinatorics, vol. I, Wadsworth & Broks/Cole, Belmont, CA, (1986).
  3. B. Poonen, Union-Closed Families, J. Combin. Theory, A 59 (1992), 253-268.
  4. M. H. El-Zahar , A Graph-Theoretic Version Of The Union-Closed Sets Conjecture, J. Graph Theory 26 (1997), no. 3, 155-163.
  5. B. Llano, J. Montellano-Ballesteros, E. Rivera-Campo and R. Strauz " On Conjecture of Frankl and El-Zahar" J. Graph Theory 57: 344-352 (2008).
  6. M. I. Moussa and E. M. Badr, A Computational Study for the Graph-Theoretic Version of the Union-Closed Sets Conjecture, International Journal of Computer Applications, Volume 50 – No. 12, July 2012.
  7. I. Foster, Desiging and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering. Addison-Wesley, 1995.
  8. W. Groop, E. Lusk, and A. Skjellum, Using MPI: Portable Parallel Programming with the Message Passing-Interface. MIT Press, 1994.
  9. E. M. Badr, M. I. Moussa, K. Paparrizos, N. Samaras and A. Sifaleras, Some Computational results on MPI Parallel Implementations of Dense Simplex Methods, Transactions on Engineering, Computing and Technology, vol. 17, pp. 228-231, 2006.

Keywords

Union closed sets conjecture, induced graphs, derived subgraphs, parallel algorithms, parallel processing