Advertisement

Near-optimal dominating sets in dense random graphs in polynomial expected time

  • Sotiris E. Nikoletseas
  • Paul G. Spirakis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 790)

Abstract

The existence and efficient finding of small dominating sets in dense random graphs is examined in this work. We show, for the model G n,p with p=1/2, that:
  1. 1.

    The probability of existence of dominating sets of size less than log n tends to zero as n tends to infinity.

     
  2. 2.

    Dominating sets of size [log n] exist almost surely.

     
  3. 3.

    We provide two algorithms which construct small dominating sets in G n, 1/2 run in O (n alog n) time (on the average and also with high probability). Our algorithms almost surely construct a dominating set of size at most (1+ε) log n, for any fixed ε > 0.

     

Our results extend to the case Gn,p with p fixed to any constant < 1.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AV,79]
    Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings”, by D.Angluin and L.Valiant, Journal of Computer and System Sciences, vol.18, p.155–193 (1979)Google Scholar
  2. [Bo,85]
    Random Graphs”, by B. Bollobás, Academic Press (1985)Google Scholar
  3. [DF,89]
    The Solution of Some Random NP-hard Problems in Polynomial Expected Time”, by M.Dyer and A.Frieze, Journal of Algorithms, vol.10, p.451–489 (1989)Google Scholar
  4. [GJ,79]
    Computers and Intractability: A Guide to the Theory of NP-Completeness”, by M.Garey and D.Johnson, W.H.Freeman and Co., NY (1979)Google Scholar
  5. [GM,75]
    On colouring random graphs”, by G. Grimmett and C. McDiarmid, Math. Proc. Cambridge Phil. Soc. 77, p.313–324 (1975)Google Scholar
  6. [Gu,91]
    Average Case Completeness”, by Y.Gurevitch, Journal of Computer and System Sciences, vol.42, p.346–348 (1991)Google Scholar
  7. [Ka,89]
    Probabilistic Analysis”, by R.Karp, Lecture Notes CS 292F, U.C.Berkeley (1989)Google Scholar
  8. [Ku,91]
    Parallel coloring of graphs with small chromatic numbers”, by L. Kučera, Technical Report, Charles Univ. Prague (1991)Google Scholar
  9. [Le,86]
    Average Case Complete Problems”, by L.Levin, vol.15, SIAM J. Comp., p.285–286 (1986)Google Scholar
  10. [Mc,84]
    Colouring random graphs”, by C. McDiarmid, Ann. Oper. Res. 1 (1984)Google Scholar
  11. [Po,76]
    Hamiltonian Circuits in Random Graphs”, by L.Posa, Discrete Mathematics, vol.14, p.359–364 (1976)Google Scholar
  12. [RS,80]
    Random Matroids”, by J.Reif and P.Spirakis, Proc. 12th Annual ACM Symp. Theory of Computing, p.385–397 (1980)Google Scholar
  13. [Sp,87]
    Ten Lectures On The Probabilistic Method”, by J.Spencer, SIAM CBMS-NSF Regional Conference Series (1987)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Sotiris E. Nikoletseas
    • 1
    • 2
  • Paul G. Spirakis
    • 1
    • 2
  1. 1.Dept of Computer Science and EngPatras UnivGreece
  2. 2.Computer Technology InstitutePatrasGreece

Personalised recommendations