Fast solution of some random NP-hard problems

@article{Dyer1986FastSO,
  title={Fast solution of some random NP-hard problems},
  author={Martin E. Dyer and Alan M. Frieze},
  journal={27th Annual Symposium on Foundations of Computer Science (sfcs 1986)},
  year={1986},
  pages={331-336}
}
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
18 Citations
2 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-2 of 2 references

T.Bui, S.Chaudhuri, T.Leighton and M.Sipser, 'Graph bisection algorithms with good average case behaviour

  • A.M.M.E. Dyer
  • Proceedings 25'th I.E.E.E. Symposium on the…
  • 1984
Highly Influential
6 Excerpts

Frieze , on the complexity of graph partitioning problems

  • M. A.
  • Discrete Applied Maths .
  • 1983

Similar Papers

Loading similar papers…