Skip to main content
SpringerLink
Log in

New Parameterized Algorithms for the Edge Dominating Set Problem

  • Conference paper
Mathematical Foundations of Computer Science 2011 (MFCS 2011)

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

Abstract

An edge dominating set of a graph G = (V,E) is a subset M ⊆ E of edges in the graph such that each edge in E − M is incident with at least one edge in M. In an instance of the parameterized edge dominating set problem we are given a graph G = (V,E) and an integer k and we are asked to decide whether G has an edge dominating set of size at most k. In this paper we show that the parameterized edge dominating set problem can be solved in O *(2.3147k) time and polynomial space. We also show that this problem can be reduced to a quadratic kernel with O(k 3) edges.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Binkele-Raible, D., Fernau, H.: Enumerate and measure: Improving parameter budget management. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 38–49. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Cardinal, J., Langerman, S., Levy, E.: Improved approximation bounds for edge dominating set in dense graphs. Theor. Comput. Sci. 410, 949–957 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fernau, H.: Edge dominating set: Efficient Enumeration-Based Exact Algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 142–153. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Fomin, F., Gaspers, S., Saurabh, S., Stepanov, A.: On two techniques of combining branching and treewidth. Algorithmica 54(2), 181–207 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fujito, T., Nagamochi, H.: A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Applied Mathematics 118(3), 19–207 (2002)

    Article  MathSciNet  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  7. Johnson, D., Yannakakis, M., Papadimitriou, C.: On generating all maximal independent sets. Information Processing Letters 27(3), 119–123 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  8. Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math. 3, 23–28 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  9. Prieto, E.: Systematic kernelization in FPT algorithm design. PhD-thesis, The University of Newcastle, Australia (2005)

    Google Scholar 

  10. Randerath, B., Schiermeyer, I.: Exact algorithms for minimum dominating set. Technical Report zaik 2005-501, Universität zu Köln, Germany (2005)

    Google Scholar 

  11. Raman, V., Saurabh, S., Sikdar, S.: Efficient exact algorithms through enumerating maximal independent sets and other techniques. Theory of Computing Systems 42(3), 563–587 (2007)

    Article  MathSciNet  Google Scholar 

  12. van Rooij, J.M.M., Bodlaender, H.L.: Exact Algorithms for Edge Domination. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 214–225. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Xiao, M.: A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 281–292. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Xiao, M., Nagamochi, H.: Exact algorithms for annotated edge dominating set in cubic graphs. TR 2011-009. Kyoto University (2011); A preliminary version appeared as: Xiao, M.: Exact and parameterized algorithms for edge dominating set in 3-degree graphs. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol. 6509, pp. 387–400. Springer, Heidelberg (2010)

    Google Scholar 

  15. Xiao, M., Nagamochi, H.: Parameterized edge dominating set in cubic graphs. In: Proceedings FAW-AAIM. LNCS, vol. 6681, pp. 100–112. Springer, Heidelberg (2011)

    Google Scholar 

  16. Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38(3), 364–372 (1980)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of Electronic Science and Technology of China, China

    Mingyu Xiao

  2. Department of Computer Science, National Tsing Hua University, Taiwan

    Ton Kloks & Sheung-Hung Poon

Authors
  1. Mingyu Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ton Kloks
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sheung-Hung Poon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Filip Murlak  & Piotr Sankowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Xiao, M., Kloks, T., Poon, SH. (2011). New Parameterized Algorithms for the Edge Dominating Set Problem. In: Murlak, F., Sankowski, P. (eds) Mathematical Foundations of Computer Science 2011. MFCS 2011. Lecture Notes in Computer Science, vol 6907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22993-0_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22993-0_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22992-3

  • Online ISBN: 978-3-642-22993-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation