• DocumentCode
    3542063
  • 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
  • fYear
    2013
  • fDate
    9-11 May 2013
  • Firstpage
    1
  • Lastpage
    3
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electro/Information Technology (EIT), 2013 IEEE International Conference on
  • Conference_Location
    Rapid City, SD
  • ISSN
    2154-0357
  • Print_ISBN
    978-1-4673-5207-9
  • Type

    conf

  • DOI
    10.1109/EIT.2013.6632658
  • Filename
    6632658
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3542063