Skip to main content
SpringerLink
Log in

A resource assignment problem on graphs

  • Session 11B
  • Conference paper
  • First Online:
Algorithms and Computations (ISAAC 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1004))

Included in the following conference series:

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

Access this chapter

Log in via an institution

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 Appl. Math., 21:177–183, 1988.

    Google Scholar 

  2. D. W. Bange, A. E. Barkauskas, and P. T. Slater. Efficient dominating sets in graphs. In R. D. Ringeisen and F. S. Roberts, editors, Applications of Discrete Mathematics, pages 189–199. SIAM, 1988.

    Google Scholar 

  3. A. A. Bertossi. On the domatic number of interval graphs. Information Processing Letters, 28(6):275–280, August 1988.

    Google Scholar 

  4. N. Biggs. Perfect codes in graphs. J. Comb. Theory, Series B, 15:289–296, 1973.

    Google Scholar 

  5. G. J. Chang, C. P. Rangan, and S. R. Coorg. Weighted independent perfect domination on cocomparability graphs. Technical Report 93-24, DIMACS, April 1993.

    Google Scholar 

  6. E. J. Cockayne and S. T. Hedetniemi. Optimal domination in graphs. IEEE Trans. Circuit and Systems, CAS-22:855–857, 1975.

    Google Scholar 

  7. M. R. Garey and D. S. Johnson. Computers and Intractability A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, 1979.

    Google Scholar 

  8. R. W. Irving. On approximating the minimum independent dominating set. Information Processing Letters, 37:197–200, 1991.

    Google Scholar 

  9. M. Livingston and Q. F. Stout. Perfect dominating sets. Congressus Numerantium., 79:187–203, 1990.

    Google Scholar 

  10. T. L. Lu, P. H. Ho, and G. J. Chang. The domatic number problem in interval graphs. SIAM J. Disc. Math., 3:531–536, 1990.

    Google Scholar 

  11. L. R. Matheson and R. E. Tarjan. Dominating sets in planar graphs. Technical Report TR-461-94, Dept. of Computer Science, Princeton University, May 1994.

    Google Scholar 

  12. A. Srinivasa Rao and C. P. Rangan. Linear algorithm for domatic number problem on interval graphs. Information Processing Letters, 33(1):29–33, October 1989.

    Google Scholar 

  13. C. C. Yen and R.C.T. Lee. The weighted perfect domination problem. Information Processing Letters, 35:295–299, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Faculty of Engineering, Hiroshima University, Kagamiyama 1-4-1, 739, Higashi-Hiroshima, Japan

    Satoshi Fujita & Masafumi Yamashita

  2. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, BC, Canada

    Tiko Kameda

Authors
  1. Satoshi Fujita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tiko Kameda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masafumi Yamashita
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Staples Peter Eades Naoki Katoh Alistair Moffat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujita, S., Kameda, T., Yamashita, M. (1995). A resource assignment problem on graphs. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015448

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60573-7

  • Online ISBN: 978-3-540-47766-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation