Skip to main content
SpringerLink
Log in

Parameterized Complexity in Multiple-Interval Graphs: Domination

  • Conference paper
Book cover Parameterized and Exact Computation (IPEC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7112))

Included in the following conference series:

Abstract

We show that several variants of the problem k -Dominating Set, including k -Connected Dominating Set, k -Independent Dominating Set, k -Dominating Clique, d -Distance k -Dominating Set, k -Perfect Code and d -Distance k -Perfect Code, when parameterized by the solution size k, remain W[1]-hard in either multiple-interval graphs or their complements or both.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Bar-Yehuda, R., Halldórsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM Journal on Computing 36, 1–15 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Butman, A., Hermelin, D., Lewenstein, M., Rawitz, D.: Optimization problems in multiple-interval graphs. ACM Transactions on Algorithms 6, 40 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cesati, M.: Perfect Code is W[1]-complete. Information Processing Letters 81, 163–168 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, Z., Fu, B., Jiang, M., Zhu, B.: On recovering syntenic blocks from comparative maps. Journal of Combinatorial Optimization 18, 307–318 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: on completeness for W[1]. Theoretical Computer Science 141, 109–131 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  6. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  7. Fellows, M.R., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science 410, 53–61 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jiang, M.: Approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots. IEEE/ACM Transactions on Computational Biology and Bioinformatics 7, 323–332 (2010)

    Article  Google Scholar 

  9. Jiang, M.: On the parameterized complexity of some optimization problems related to multiple-interval graphs. Theoretical Computer Science 411, 4253–4262 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jiang, M.: Recognizing d-Interval Graphs and d-Track Interval Graphs. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 160–171. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Jiang, M., Zhang, Y.: Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 62–73. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Kratochvíl, J.: Perfect codes in general graphs. Akademia Praha (1991)

    Google Scholar 

  13. Roberts, F.S.: Graph Theory and Its Applications to Problems of Society. SIAM (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utah State University, Logan, UT, 84322, USA

    Minghui Jiang

  2. Department of Computer Science, Kutztown University of PA, Kutztown, PA, 19530, USA

    Yong Zhang

Authors
  1. Minghui Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. MTA SZTAKI, Lágymányosi u. 11, 1111, Budapest, Hungary

    Dániel Marx

  2. Lehrgebiet Theoretische Informatik, RWTH Aachen, Ahornstraße 55, 52056, Aachen, Germany

    Peter Rossmanith

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, M., Zhang, Y. (2012). Parameterized Complexity in Multiple-Interval Graphs: Domination. In: Marx, D., Rossmanith, P. (eds) Parameterized and Exact Computation. IPEC 2011. Lecture Notes in Computer Science, vol 7112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28050-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28050-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28049-8

  • Online ISBN: 978-3-642-28050-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation