Algorithms for Graph Partitioning on the Planted Partition Model

Anne Condon, Richard M. Karp. Algorithms for Graph Partitioning on the Planted Partition Model. In Dorit S. Hochbaum, Klaus Jansen, José D. P. Rolim, Alistair Sinclair, editors, Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Opti. Volume 1671 of Lecture Notes in Computer Science, pages 221-232, Springer, 1999.

@inproceedings{CondonK99,
  title = {Algorithms for Graph Partitioning on the Planted Partition Model},
  author = {Anne Condon and Richard M. Karp},
  year = {1999},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/CondonK99},
  cites = {0},
  citedby = {0},
  pages = {221-232},
  booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Opti},
  editor = {Dorit S. Hochbaum and Klaus Jansen and José D. P. Rolim and Alistair Sinclair},
  volume = {1671},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66329-0},
}