Parallel graph algorithms that are efficient on average

@article{Coppersmith1987ParallelGA,
  title={Parallel graph algorithms that are efficient on average},
  author={Don Coppersmith and Prabhakar Raghavan and Martin Tompa},
  journal={28th Annual Symposium on Foundations of Computer Science (sfcs 1987)},
  year={1987},
  pages={260-269}
}
The following three problems concerning random graphs can be solved in (log n)O(1) expected time using linearly many processors: (1) finding the lexicographically first maximal independent set, (2) coloring the vertices using a number of colors that is almost surely within twice the chromatic number, and (3) finding a Hamiltonian circuit. 

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs,

  • P. Raghavan
  • Proceedings of 27th Annual Symposium on…
  • 1986

An Introduction to Probability Theory and Its Applications, Volume I, 3rd Edition, section X.6

  • W. Feller
  • (page 257),
  • 1968

A taxonomy of · problems with fast parallel algorithms

  • A. H. G. Rinooy Kan, D. B. Shmoys

Similar Papers

Loading similar papers…