Skip to main content
SpringerLink
Log in

An Improved Algorithm for Parameterized Edge Dominating Set Problem

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2015)

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

Included in the following conference series:

Abstract

An edge dominating set of a graph G = (V, E) is a subset M ⊆ E of edges such that each edge in E ∖ M is incident to at least one edge in M. In this paper, we consider the parameterized edge dominating set problem which asks us to test whether a given graph has an edge dominating set with size bounded from above by an integer k or not, and we design an O*(2.2351k)-time and polynomial-space algorithm. This is an improvement over the previous best time bound of O*(2.3147k). We also show that a related problem: the parameterized weighted edge dominating set problem can be solved in O*(2.2351k) time and polynomial space.

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. 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 

  3. Fomin, F., Gaspers, S., Saurabh, S., Stepanov, A.: On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2), 181–207 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to The Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  5. Iwaide, K., Nagamochi, H.: An Improved Algorithm for Parameterized Edge Dominating Set Problem. Technical Report 2014-004 Kyoto University (2014), http://www.amp.i.kyoto-u.ac.jp/tecrep/

  6. 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 

  7. Randerath, B., Schiermeyer, I.: Exact Algorithms for Minimum Dominating Set. Technical Report zaik 2005-501, Universität zu Köln, Cologne, Germany (2005)

    Google Scholar 

  8. van Rooij, J.M.M., Bodlaender, H.L.: Exact Algorithms for Edge Domination. Algorithmica 64(4), 535–563 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  9. 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 

  10. Xiao, M., Kloks, T., Poon, S.-H.: New Parameterized Algorithms for the Edge Dominating Set Problem. TCS 511, 147–158 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  11. Xiao, M., Nagamochi, H.: Parameterized Edge Dominating Set in Cubic Graphs. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 100–112. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Xiao, M., Nagamochi, H.: A Refined Exact Algorithm for Edge Dominating Set. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol. 7287, pp. 360–372. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Xiao, M., Nagamochi, H.: Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3. IEICE Transactions on Information and Systems E96-D(3), 408–418 (2013)

    Article  Google Scholar 

  14. Yanakakis, M., Gavril, F.: Edge Dominating Set in Graphs. SIAM J. Appl. Math. 38(3), 364–372 (1980)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan

    Ken Iwaide & Hiroshi Nagamochi

Authors
  1. Ken Iwaide
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of CSE, BUET, ECE Building, West Palasi, 1205, Dhaka, Bangladesh

    M. Sohel Rahman

  2. The Advanced Algorithms Research Laboratory, The University of Electro-Communications, Chofugaoka 1-5-1, 182-8585, Chofu, Tokyo, Japan

    Etsuji Tomita

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Iwaide, K., Nagamochi, H. (2015). An Improved Algorithm for Parameterized Edge Dominating Set Problem. In: Rahman, M.S., Tomita, E. (eds) WALCOM: Algorithms and Computation. WALCOM 2015. Lecture Notes in Computer Science, vol 8973. Springer, Cham. https://doi.org/10.1007/978-3-319-15612-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15612-5_21

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15611-8

  • Online ISBN: 978-3-319-15612-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation