Linear time algorithms for finding a dominating set of fixed size in degenerated graphs

Algorithmica (New York)

Volumn 54, Issue 4, 2009, Pages 544-556

  Alon, Noga ^a   Gutner, Shai ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Degenerated graphs; Dominating set problem; Finding an induced cycle; Fixed parameter tractable algorithms; H minor free graphs

Indexed keywords

DEGENERATED GRAPHS; DOMINATING SET PROBLEM; FINDING AN INDUCED CYCLE; FIXED-PARAMETER TRACTABLE ALGORITHMS; H-MINOR-FREE GRAPHS;

ALGORITHMS;

GRAPH THEORY;

EID: 67349149967     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9204-0     Document Type: Article

References (24)

1. J. Alber H.L. Bodlaender H. Fernau T. Kloks R. Niedermeier 2002 Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs Algorithmica 33 4 461 493
2. J. Alber H. Fan M.R. Fellows H. Fernau R. Niedermeier F.A. Rosamond U. Stege 2005 A refined search tree technique for dominating set on planar graphs J. Comput. Syst. Sci. 71 4 385 405
3. N. Alon G.D. Cohen M. Krivelevich S. Litsyn 2003 Generalized hashing and parent-identifying codes J. Comb. Theory Ser. A 104 1 207 215 (Pubitemid 37457195)
4. N. Alon R. Yuster U. Zwick 1995 Color-coding J. ACM 42 4 844 856
5. N. Alon R. Yuster U. Zwick 1997 Finding and counting given length cycles Algorithmica 17 3 209 223 (Pubitemid 127440916)
6. B. Bollobás A. Thomason 1998 Proof of a conjecture of Mader, Erdös and Hajnal on topological complete subgraphs Eur. J. Comb. 19 8 883 887 (Pubitemid 128387430)
7. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier, New York (1976)
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) (Pubitemid 44609928)
9. E.D. Demaine F.V. Fomin M. Hajiaghayi D.M. Thilikos 2005 Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs ACM Trans. Algorithms 1 1 33 47
10. E.D. Demaine F.V. Fomin M. Hajiaghayi D.M. Thilikos 2005 Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs J. ACM 52 6 866 893 (Pubitemid 43906506)
11. Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Berlin (2005)
12. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)
13. J.A. Ellis H. Fan M.R. Fellows 2004 The dominating set problem is fixed parameter tractable for graphs of bounded genus J. Algorithms 52 2 152 168
14. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)
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. A. Itai M. Rodeh 1978 Finding a minimum circuit in a graph SIAM J. Comput. 7 4 413 423
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)
18. J. Komlós E. Szemerédi 1996 Topological cliques in graphs II Comb. Probab. Comput. 5 79 90 (Pubitemid 126670493)
19. A.V. Kostochka 1984 Lower bound of the Hadwiger number of graphs by their average degree Combinatorica 4 4 307 316
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. A. Thomason 1984 An extremal function for contractions of graphs Math. Proc. Camb. Philos. Soc. 95 2 261 265
22. A. Thomason 2001 The extremal function for complete minors J. Comb. Theory Ser. B 81 2 318 338 (Pubitemid 33667135)
23. R. Yuster U. Zwick 1997 Finding even cycles even faster SIAM J. Discrete Math. 10 2 209 222 (Pubitemid 127577161)
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)