Skip to main content
SpringerLink
Log in

On-line Dominating Set Problems for Graphs

  • Chapter
Book cover Handbook of Combinatorial Optimization

  • 4266 Accesses

Abstract

A dominating set of a graph G = (V, E) is a subset V’ of V such that for each vertex u ∈ V — V’ there is a vertex v ∈ V’ so that (u, v) ∈ E. The minimum dominating set problem is to find a set V’ of minimum cardinality, which is denoted by ø(G). It is well known that the minimum dominating set problem is NP-complete [9]. In this paper we consider on-line dominating set problems for general and permutation (simple) graphs.

Research supported in part by grant NSC-86-2213-E-009-024, National Science Council, Taiwan.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.J. Atallah, G.K. Manacher, and J. Urrutia, Finding a minimum independent dominating set in a permutation graph, Discrete Applied Mathematics Vol. 21 (1988) pp. 177–183.

    Article  MATH  MathSciNet  Google Scholar 

  2. K. Arvind and C.P. Rangan, Connected domination and Steiner set on weighted permutation graphs, Information Processing Letters Vol. 41 (1992) pp. 215–220.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Bar-Noy, R. Motwani, and J. Naor, The greedy algorithm is optimal for on-line edge coloring, Information Processing Letters Vol. 44 (1992) pp. 251–253.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Brandstadt and D. Kratsch, On domination problems for permutation and other graphs, Theoretical Computer Science Vol. 54 (1987) pp. 181–198.

    Article  MathSciNet  Google Scholar 

  5. M. Chrobak and L.L. Larmore, On fast algorithms for two servers. Journal of Algorithms Vol. 12 (1991) pp. 607–614.

    Article  MATH  MathSciNet  Google Scholar 

  6. C.J. Colbourn, J.K. Keil, and L.K. Stewart, Finding minimum dominating cycles in permutations graphs. Operations Research Letters Vol. 4 No. 1 (1985) pp. 13–17.

    Article  MATH  MathSciNet  Google Scholar 

  7. C.J. Colbourn and L.K. Stewart, Permutation graphs: connected domination and Steiner trees, Discrete Mathematics Vol. 86 (1990) pp. 179–189.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Farber and J.M. Keil, Domination in permutation graphs. Journal of Algorithms Vol. 6 (1985) pp. 309–321.

    Article  MATH  MathSciNet  Google Scholar 

  9. M.R. Carey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. (San Francisco, Freeman, 1979).

    Google Scholar 

  10. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, (New York, Academic Press, 1980).

    MATH  Google Scholar 

  11. O.H. Ibarra and Q. Zheng, Some efficient algorithms for permutation graphs, Journal of Algorithms Vol. 16 (1994) pp. 453–469.

    Article  MATH  MathSciNet  Google Scholar 

  12. R.M. Karp, U.V. Vazirani, and V.V. Vazirani, An optimal algorithm for on-line bipartite matching, Proceedings of the 22nd Annual ACM Symposium of Theory of Computing (1990) pp. 352–358.

    Google Scholar 

  13. G.-H. King and W.-G. Tzeng, On-line algorithms for the domination set problem, Information Processing Letters Vol. 61 (1997) pp. pp.11–14.

    Article  MathSciNet  Google Scholar 

  14. E. Koutsoupias and C.H. Papadimitriou, On the k-server conjecture, Journal of the ACM, Vol. 42 (1995) pp. 971–983.

    Article  MATH  MathSciNet  Google Scholar 

  15. Y. Liang, C. Rhee, S.K. Dhall, S. Lakshmivarahan, A new approach for the domination problem on permutation graphs, Information Processing Letters Vol. 37 (1991) pp. 219–224.

    Article  MATH  MathSciNet  Google Scholar 

  16. M.S. Manasse, L.A. McGeoch and D.D. Sleator, Competitive algorithms for server problems, Journal of Algorithms Vol. 11 (1990) pp. 208–230.

    Article  MATH  MathSciNet  Google Scholar 

  17. C. Rhee, Y. Liang, S.K. Dhall and S. Lakshmivarahan, An O(m+n)-time algorithm for finding a minimum-weight dominating set in a permutation graph, SIAM Journal on Computing Vol. 25 No. 2 (1996) pp. 404–419.

    Article  MATH  MathSciNet  Google Scholar 

  18. D.D. Sleator and R.E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM Vol. 28 No. 2 (1985) pp. 202–208.

    Article  MathSciNet  Google Scholar 

  19. A. Srinivasan and C.P. Rangan, Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs, Theoretical Computer Science Vol. 91 (1991) pp. 1–21.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, National Chiao Tung University, Hsinchu, 30050, Taiwan

    Wen-Guey Tzeng

Authors
  1. Wen-Guey Tzeng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, USA

    Ding-Zhu Du

  2. University of Florida, Gainesville, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Kluwer Academic Publishers

About this chapter

Cite this chapter

Tzeng, WG. (1998). On-line Dominating Set Problems for Graphs. In: Du, DZ., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0303-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0303-9_19

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7987-4

  • Online ISBN: 978-1-4613-0303-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation