A Scalability and Sensitivity Study of Parallel Geometric Algorithms for Graph Partitioning

Shad Kirmani, Hongyang Sun, Padma Raghavan. A Scalability and Sensitivity Study of Parallel Geometric Algorithms for Graph Partitioning. In 30th International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2018, Lyon, France, September 24-27, 2018. pages 420-427, IEEE, 2018. [doi]

@inproceedings{KirmaniSR18,
  title = {A Scalability and Sensitivity Study of Parallel Geometric Algorithms for Graph Partitioning},
  author = {Shad Kirmani and Hongyang Sun and Padma Raghavan},
  year = {2018},
  doi = {10.1109/CAHPC.2018.8645916},
  url = {https://doi.org/10.1109/CAHPC.2018.8645916},
  researchr = {https://researchr.org/publication/KirmaniSR18},
  cites = {0},
  citedby = {0},
  pages = {420-427},
  booktitle = {30th International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2018, Lyon, France, September 24-27, 2018},
  publisher = {IEEE},
  isbn = {978-1-5386-7769-8},
}