Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 246-257

  Gutner, Shai ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Degenerated graphs; Dominating set problem; Fixed parameter tractable algorithms; H minor free graphs; Problem kernel

Indexed keywords

BEST-KNOWN ALGORITHMS; DOMINATING SET PROBLEMS; DOMINATING SETS; DOMINATION NUMBER; EXACT ALGORITHMS; EXCLUDED-MINORS; FREE GRAPHS; GRAPH G; INPUT GRAPHS; INPUT SIZE; LINEAR KERNEL; POLYNOMIAL KERNELS; POLYNOMIAL SIZE; POLYNOMIAL-TIME ALGORITHMS; PROBLEM KERNEL; RUNNING TIME; SIMPLER ALGORITHMS; SUBGRAPHS; TIME ALGORITHMS; TOPOLOGICAL-MINOR; TRACTABLE ALGORITHMS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL EFFICIENCY; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 72249089074     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_20     Document Type: Conference Paper

References (26)

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)
2. Alber, J., Dorn, B., Niedermeier, R.: A general data reduction scheme for domination in graphs. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 137-147. Springer, Heidelberg (2006)
3. 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)
4. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. Journal of the ACM 51(3), 363-384 (2004)
5. Alon, N., Gutner, S.: Kernels for the dominating set problem on graphs with an excluded minor. Electronic Colloquium on Computational Complexity (ECCC) 15(066) (2008)
6. Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica 54(4), 544-556 (2009)
7. 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)
8. Bondy, J.A., Murty, U.S.R.: Graph theory with applications. American Elsevier Publishing Co., Inc., New York (1976)
9. Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37(4), 1077-1106 (2007)
10. 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 Transactions on Algorithms 1(1), 33-47 (2005)
11. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Journal of the ACM 52(6), 866-893 (2005)
12. Diestel, R.: Graph theory, 3rd edn. Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2005)
13. Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, New York (1999)
14. 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)
15. Flum, J., Grohe, M.: Parameterized complexity theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)
16. Fomin, F.V., Thilikos, D.M.: Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 581-592. Springer, Heidelberg (2004)
17. Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM J. Comput. 36(2), 281-309 (2006)
18. Grohe, M.: Local tree-width, excluded minors, and approximation algorithms. Combinatorica 23(4), 613-632 (2003)
19. Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12(3), 277-286 (1982)
20. Kanj, I.A., Perkovic, L.: Improved parameterized algorithms for planar dominating set. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 399-410. Springer, Heidelberg (2002)
21. Komlós, J., Szemerédi, E.: Topological cliques in graphs II. Combinatorics. Probability & Computing 5, 79-90 (1996)
22. Kostochka, A.V.: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4(4), 307-316 (1984)
23. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press, Oxford (2006)
24. Philip, G., Raman, V., Sikdar, S.: Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 694-705. Springer, Heidelberg (2009)
25. Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 95(2), 261-265 (1984)
26. Thomason, A.: The extremal function for complete minors. J. Comb. Theory, Ser. B 81(2), 318-338 (2001)