Efficient Parallelization of Simulated Annealing Using Multiple Markov Chains: An Application to Graph Partitioning

Kyung-Geun Lee, Soo-Young Lee. Efficient Parallelization of Simulated Annealing Using Multiple Markov Chains: An Application to Graph Partitioning. In ICPP (1). pages 177-180, 1992.

@inproceedings{LeeL92a,
  title = {Efficient Parallelization of Simulated Annealing Using Multiple Markov Chains: An Application to Graph Partitioning},
  author = {Kyung-Geun Lee and Soo-Young Lee},
  year = {1992},
  tags = {graph-rewriting, Markov, rewriting, partitioning},
  researchr = {https://researchr.org/publication/LeeL92a},
  cites = {0},
  citedby = {0},
  pages = {177-180},
  booktitle = {ICPP (1)},
}