CFP last date
28 November 2025
Call for Paper
December Edition
IJAIS solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 28 November 2025

Submit your paper
Know more
The week's pick
Responsive image
Exploring Search-Based Applications in the Software Development Life Cycle: A Literature Review

Abeer Alarainy Nora Madi Aljawharah Al-Muaythir Abir Benabid Najjar
Random Articles
Reseach Article

Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm

by E. M. Badr
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 4 - Number 8
Year of Publication: 2012
Authors: E. M. Badr
10.5120/ijais12-450735

E. M. Badr . Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm. International Journal of Applied Information Systems. 4, 8 ( December 2012), 1-6. DOI=10.5120/ijais12-450735

@article{ 10.5120/ijais12-450735,
author = { E. M. Badr },
title = { Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm },
journal = { International Journal of Applied Information Systems },
issue_date = { December 2012 },
volume = { 4 },
number = { 8 },
month = { December },
year = { 2012 },
issn = { 2249-0868 },
pages = { 1-6 },
numpages = {9},
url = { https://www.ijais.org/archives/volume4/number8/375-0735/ },
doi = { 10.5120/ijais12-450735 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T10:47:41.487445+05:30
%A E. M. Badr
%T Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 4
%N 8
%P 1-6
%D 2012
%I Foundation of Computer Science (FCS), NY, 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.

References
  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.
Index Terms

Computer Science
Information Sciences

Keywords

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

Powered by PhDFocusTM