Title :
Parallelizing an algorithm to decide if a bipartite graph is shellable
Author :
Galvis, Andres ; Cruz, Rene ; Trefftz, Christian ; Branch, Joel W.
Author_Institution :
Inst. de Mat., Univ. de Antioquia Medellin Colombia, Antioquia, Colombia
Abstract :
An algorithm to decide if a bipartite graph is shellable was parallelized using pthreads. Performance results are reported.
Keywords :
graph theory; parallel algorithms; bipartite graph; pthreads; shellability; Bipartite graph; Computers; Electronic mail; Instruction sets; Microprocessors; Software algorithms; South America;
Conference_Titel :
Electro/Information Technology (EIT), 2013 IEEE International Conference on
Conference_Location :
Rapid City, SD
Print_ISBN :
978-1-4673-5207-9
DOI :
10.1109/EIT.2013.6632658
