Parallel Graph Algorithms that Are Efficient on Average

Don Coppersmith, Prabhakar Raghavan, Martin Tompa. Parallel Graph Algorithms that Are Efficient on Average. In 28th Annual Symposium on Foundations of Computer Science, 12-14 October 1987, Los Angeles, California, USA. pages 260-269, IEEE, 1987.

@inproceedings{CoppersmithRT87,
  title = {Parallel Graph Algorithms that Are Efficient on Average},
  author = {Don Coppersmith and Prabhakar Raghavan and Martin Tompa},
  year = {1987},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/CoppersmithRT87},
  cites = {0},
  citedby = {0},
  pages = {260-269},
  booktitle = {28th Annual Symposium on Foundations of Computer Science, 12-14 October 1987, Los Angeles, California, USA},
  publisher = {IEEE},
}