Parallelizing an algorithm to decide if a bipartite graph is shellable

Andres Galvis, Roberto Cruz, John W. Branch, Christian Trefftz. Parallelizing an algorithm to decide if a bipartite graph is shellable. In IEEE International Conference on Electro-Information Technology , EIT 2013, Rapid City, SD, USA, May 9-11, 2013. pages 1-3, IEEE, 2013. [doi]

@inproceedings{GalvisCBT13,
  title = {Parallelizing an algorithm to decide if a bipartite graph is shellable},
  author = {Andres Galvis and Roberto Cruz and John W. Branch and Christian Trefftz},
  year = {2013},
  doi = {10.1109/EIT.2013.6632658},
  url = {http://dx.doi.org/10.1109/EIT.2013.6632658},
  researchr = {https://researchr.org/publication/GalvisCBT13},
  cites = {0},
  citedby = {0},
  pages = {1-3},
  booktitle = {IEEE International Conference on Electro-Information Technology , EIT 2013, Rapid City, SD, USA, May 9-11, 2013},
  publisher = {IEEE},
}