Skip to main content
SpringerLink
Log in

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

There is substantial literature dealing with fixed parameter algorithms for the dominating set problem on various families of graphs. In this paper, we give a k O(dk) n time algorithm for finding a dominating set of size at most k in a d-degenerated graph with n vertices. This proves that the dominating set problem is fixed-parameter tractable for degenerated graphs. For graphs that do not contain K h as a topological minor, we give an improved algorithm for the problem with running time (O(h))hk n. For graphs which are K h -minor-free, the running time is further reduced to (O(log h))hk/2 n. Fixed-parameter tractable algorithms that are linear in the number of vertices of the graph were previously known only for planar graphs.

For the families of graphs discussed above, the problem of finding an induced cycle of a given length is also addressed. For every fixed H and k, we show that if an H-minor-free graph G with n vertices contains an induced cycle of size k, then such a cycle can be found in O(n) expected time as well as in O(nlog n) worst-case time. Some results are stated concerning the (im)possibility of establishing linear time algorithms for the more general family of degenerated graphs.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs. Algorithmica 33(4), 461–493 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alber, J., Fan, H., Fellows, M.R., Fernau, H., Niedermeier, R., Rosamond, F.A., Stege, U.: A refined search tree technique for dominating set on planar graphs. J. Comput. Syst. Sci. 71(4), 385–405 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alon, N., Cohen, G.D., Krivelevich, M., Litsyn, S.: Generalized hashing and parent-identifying codes. J. Comb. Theory Ser. A 104(1), 207–215 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209–223 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bollobás, B., Thomason, A.: Proof of a conjecture of Mader, Erdös and Hajnal on topological complete subgraphs. Eur. J. Comb. 19(8), 883–887 (1998)

    Article  MATH  Google Scholar 

  7. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier, New York (1976)

    Google Scholar 

  8. Cai, L., Chan, S.M., Chan, S.O.: Random separation: a new method for solving fixed-cardinality optimization problems. In: Bodlaender, H.L., Langston, M.A. (eds.) Second International Workshop on Parameterized and Exact Computation. Lecture Notes in Computer Science, vol. 4169, pp. 239–250. Springer, Berlin (2006)

    Chapter  Google Scholar 

  9. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. ACM Trans. Algorithms 1(1), 33–47 (2005)

    Article  MathSciNet  Google Scholar 

  10. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6), 866–893 (2005)

    Article  MathSciNet  Google Scholar 

  11. Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Berlin (2005)

    MATH  Google Scholar 

  12. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)

    Google Scholar 

  13. Ellis, J.A., Fan, H., Fellows, M.R.: The dominating set problem is fixed parameter tractable for graphs of bounded genus. J. Algorithms 52(2), 152–168 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)

    Google Scholar 

  15. Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: branch-width and exponential speed-up. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 168–177 (2003)

  16. Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413–423 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kanj, I.A., Perkovic, L.: Improved parameterized algorithms for planar dominating set. In: Diks, K., Rytter, W. (eds.) 27th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 2420, pp. 399–410. Springer, Berlin (2002)

    Google Scholar 

  18. Komlós, J., Szemerédi, E.: Topological cliques in graphs II. Comb. Probab. Comput. 5, 79–90 (1996)

    Article  MATH  Google Scholar 

  19. Kostochka, A.V.: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4(4), 307–316 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  20. Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science, pp. 182–191 (1995)

  21. Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Camb. Philos. Soc. 95(2), 261–265 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  22. Thomason, A.: The extremal function for complete minors. J. Comb. Theory Ser. B 81(2), 318–338 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  23. Yuster, R., Zwick, U.: Finding even cycles even faster. SIAM J. Discrete Math. 10(2), 209–222 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  24. Yuster, R., Zwick, U.: Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 254–260 (2004)

Download references

Author information

Authors and Affiliations

  1. Schools of Mathematics and Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel

    Noga Alon

  2. School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel

    Shai Gutner

Authors
  1. Noga Alon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shai Gutner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shai Gutner.

Additional information

A preliminary version of this paper appeared in the Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON), Banff, Alberta, Canada (2007), pp. 394–405.

N. Alon research supported in part by a grant from the Israel Science Foundation, and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University.

This paper forms part of a Ph.D. thesis written by S. Gutner under the supervision of Prof. N. Alon and Prof. Y. Azar in Tel Aviv University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alon, N., Gutner, S. Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Algorithmica 54, 544–556 (2009). https://doi.org/10.1007/s00453-008-9204-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-008-9204-0

Keywords

Search

Navigation