An algorithm for improving graph partitions

Reid Andersen, Kevin J. Lang. An algorithm for improving graph partitions. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. pages 651-660, SIAM, 2008. [doi]

@inproceedings{AndersenL08:0,
  title = {An algorithm for improving graph partitions},
  author = {Reid Andersen and Kevin J. Lang},
  year = {2008},
  doi = {10.1145/1347082.1347154},
  url = {http://doi.acm.org/10.1145/1347082.1347154},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/AndersenL08%3A0},
  cites = {0},
  citedby = {0},
  pages = {651-660},
  booktitle = {Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008},
  editor = {Shang-Hua Teng},
  publisher = {SIAM},
}