Skip to main content
SpringerLink
Log in

On parallelizing a greedy heuristic for finding small dominant sets

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

We analyse a greedy heuristic for finding small dominating sets in graphs: bounds on the size of the dominating set so produced had previously been derived in terms of the size of a smallest dominating set and the number of vertices and edges in the graph, respectively, We show that computing the resulting small dominating set isP-hard and so cannot be done efficiently in parallel (in the context of the PRAM model of parallel computation). We also consider a related non-deterministic greedy heuristic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Anderson and E. Mayr,Parallelism and the maximal path problem, Inform. Process. Lett., Vol. 82, No. 2 (1987), 121–126.

    Google Scholar 

  2. V. Chvatal,A greedy heuristic for the set covering problem, Math. Oper. Res., Vol. 4 (1979), 233–235.

    Google Scholar 

  3. S. A. Cook,A taxonomy of problems with fast parallel algorithms, Inform. Control, Vol. 64, Nos. 1–3 (1985), 2–22.

    Google Scholar 

  4. R. Greenlaw,Ordered vertex removal and subgraph problems, J. Comput. System Sci., No. 3, Vol. 39 (1989), 323–342.

    Google Scholar 

  5. R. Greenlaw, H. J. Hoover and W. L. Ruzzo,A compendium of problems complete for P Part II: P-complete problems, Dept. Computer Science Tech. Rep., Univ. Alberta, to appear.

  6. D. S. Hochbaum,Approximation algorithms for the set covering and vertex covering problems, SIAM J. Comput., Vol. 11 (1982), 555–556.

    Google Scholar 

  7. D. S. Johnson,Approximate algorithms for combinatorial problems, J. Comput. System Sci., Vol. 9 (1974), 256–278.

    Google Scholar 

  8. R. M. Karp and V. Ramachandran,Parallel algorithms for shared-memory machines, in:Handbook of Theoretical Computer Science (Ed. J. van Leeuwen), Elsevier Science Publishers B.V. (1990), 869–941.

  9. A. K. Parekh,Analysis of a greedy heuristic for finding small dominating sets in graphs, Inform. Process. Lett., Vol. 39 (1991), 237–240.

    Google Scholar 

  10. J. Reif,Depth-first search is inherently sequential, Inform. Process. Lett., Vol. 20, No. 5 (1985), 229–234.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University College of Swansea, Singleton Park, SA2 8PP, Swansea, U.K.

    Iain A. Stewart

Authors
  1. Iain A. Stewart
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stewart, I.A. On parallelizing a greedy heuristic for finding small dominant sets. BIT 33, 57–62 (1993). https://doi.org/10.1007/BF01990343

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01990343

CR Classification

Keywords

Search

Navigation