Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1994: Algorithms and Computation pp 567–574Cite as

Weighted irredundance of interval graphs

  • Conference paper
  • First Online:

  • 125 Accesses

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

Abstract

In this paper, an O(n 3) algorithm is given for finding a minimum weighted maximal irredundant set of an interval graph.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. A. Bertossi and A. Gori, Total domination and irredundance in weighted interval graphs, SIAM J. on Discrete Mathematics, 1 (1988) 317–327.

    Google Scholar 

  2. M.A. Bonuccelli, Dominating sets and domatic number of Circular arc Graphs, Sl Discrete Applies Maths, 12, (1985), pp 203–213.

    Google Scholar 

  3. K. S. Booth and G. S. Leuker, Testing for consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13 (1976) 335–379.

    Google Scholar 

  4. M. S. Chang, F. H. Hsing and S. L. Peng, Irredundance of weighted interval graphs, Proceedings of National Computer Symposium, Republic of China, (1993) 128–137.

    Google Scholar 

  5. M. S. Chang, C. Pandu Rangan and A. Raman, Irredundance on some special classes of graphs, Under Preparation, (1994).

    Google Scholar 

  6. R. Lasker and J. Pfaff, Domination and irredundance in split graphs, manuscript, (1983).

    Google Scholar 

  7. P. Nagavamsi and C. Pandu Rangan, Domination and other related problems on certain classes of perfect graphs, Technical Report, Dept. of Computer Science and Engineering, Indian Institute of Technology, Madras 600 036, India, (1993).

    Google Scholar 

  8. A. Raman and C. Pandu Rangan, Irredundance on Interval Graphs and other Classes of graphs, Technical Report, TR-TCS-92-01, Dept. of Computer Science and Engineering, Indian Institute of Technology, Madras 600 036, India, (1992).

    Google Scholar 

  9. T. W. Wimer, Linear algorithms on k-terminal graphs, Ph. D. thesis, Dept. of Computer Sci., Clemson University, Clemson, SC, (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, 600 036, Madras, India

    C. Pandu Rangan

  2. Department of Computer Science and Information Engineering, National Chung Cheng University, Ming-Hsiun, Chiayi, 621, Taiwan, China

    Maw-Shang Chang

Authors
  1. C. Pandu Rangan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maw-Shang Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Xiang-Sun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pandu Rangan, C., Chang, MS. (1994). Weighted irredundance of interval graphs. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_224

Download citation

  • DOI: https://doi.org/10.1007/3-540-58325-4_224

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation