Skip to main content
SpringerLink
Log in

Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs

  • Conference paper
Book cover Combinatorial Optimization and Applications (COCOA 2010)

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

Abstract

Given a graph G = (V,E), the edge dominating set problem is to find a minimum set M ⊆ E such that each edge in E – M has at least one common endpoint with an edge in M. The edge dominating set problem is an important graph problem and has been extensively studied. It is well known that the problem is NP-hard, even when the graph is restricted to a planar or bipartite graph with maximum degree 3. In this paper, we show that the edge dominating set problem in graphs with maximum degree 3 can be solved in O *(1.2721n) time and polynomial space, where n is the number of vertices in the graph. We also show that there is an O *(2.2306k)-time polynomial-space algorithm to decide whether a graph with maximum degree 3 has an edge dominating set of size k or not. Above two results improve previously known results on exact and parameterized algorithms for this problem.

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. Tarjan, R., Trojanowski, A.: Finding a maximum independent set. SIAM Journal on Computing 6(3), 537–546 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  2. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: a simple O(20.288n) independent set algorithm. In: SODA, pp. 18–25. ACM Press, New York (2006)

    Chapter  Google Scholar 

  3. Beigel, R., Eppstein, D.: 3-coloring in time O(1. 3289n). J. Algorithms 54(2), 168–204 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bjorklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52(2), 226–249 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: Domination - a case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 191–203. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Rooij, J.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 

  7. Razgon, I.: Exact computation of maximum induced forest. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 160–171. Springer, Heidelberg (2006)

    Google Scholar 

  8. Bourgeois, N., Escoffier, B., Paschos, V.T., Rooij, J.M.M.: Maximum independent set in graphs of average degree at most three in O(1.08537n). In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds.) Theory and Applications of Models of Computation. LNCS, vol. 6108, pp. 373–384. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Xiao, M.: A note on vertex cover in graphs with maximum degree 3. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 150–159. Springer, Heidelberg (2010)

    Google Scholar 

  10. Iwama, K., Nakashima, T.: An improved exact algorithm for cubic graph tsp. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 108–117. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Chen, J., Kanj, I.A., Xia, G.: Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems. Algorithmica 43(4), 245–273 (2005); A preliminary version appeared in ISAAC 2003

    Article  MathSciNet  MATH  Google Scholar 

  12. Fomin, F.V., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. 97(5), 191–196 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Razgon, I.: Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. J. of Discrete Algorithms 7(2), 191–212 (2009)

    Article  MathSciNet  MATH  Google Scholar 

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

  15. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)

    Book  MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  18. Randerath, B., Schiermeyer, I.: Exact algorithms for minimum dominating set. Technical Report zaik 2005-501, Universitat zu Koln, Cologne, Germany (2005)

    Google Scholar 

  19. 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  MATH  Google Scholar 

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

  21. Fernau, H.: Edge dominating set: Efficient enumeration-based exact algorithms. In: Bodlaender, H., Langston, M. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 142–153. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  22. Razgon, I.: A faster solving of the maximum independent set problem for graphs with maximal degree 3. In: Broersma, H., Dantchev, S.S., Johnson, M., Szeider, S. (eds.) ACiD. Texts in Algorithmics, vol. 7, pp. 131–142. King’s College, London (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 610054, P.R. China

    Mingyu Xiao

Authors
  1. Mingyu Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Weili Wu  & Ovidiu Daescu  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiao, M. (2010). Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17461-2_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17460-5

  • Online ISBN: 978-3-642-17461-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation