SWR: Using Windowed Reordering to Achieve Fast and Balanced Heuristic for Streaming Vertex-Cut Graph Partitioning

Jie Wang, Dagang Li. SWR: Using Windowed Reordering to Achieve Fast and Balanced Heuristic for Streaming Vertex-Cut Graph Partitioning. In Sheng Wen, Albert Y. Zomaya, Laurence T. Yang, editors, Algorithms and Architectures for Parallel Processing - 19th International Conference, ICA3PP 2019, Melbourne, VIC, Australia, December 9-11, 2019, Proceedings, Part I. Volume 11944 of Lecture Notes in Computer Science, pages 17-32, Springer, 2019. [doi]

@inproceedings{WangL19-100,
  title = {SWR: Using Windowed Reordering to Achieve Fast and Balanced Heuristic for Streaming Vertex-Cut Graph Partitioning},
  author = {Jie Wang and Dagang Li},
  year = {2019},
  doi = {10.1007/978-3-030-38991-8_2},
  url = {https://doi.org/10.1007/978-3-030-38991-8_2},
  researchr = {https://researchr.org/publication/WangL19-100},
  cites = {0},
  citedby = {0},
  pages = {17-32},
  booktitle = {Algorithms and Architectures for Parallel Processing - 19th International Conference, ICA3PP 2019, Melbourne, VIC, Australia, December 9-11, 2019, Proceedings, Part I},
  editor = {Sheng Wen and Albert Y. Zomaya and Laurence T. Yang},
  volume = {11944},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-38991-8},
}