Parameterized complexity for domination problems on degenerate graphs

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

Volumn 5344 LNCS, Issue , 2008, Pages 195-205

  Golovach, Petr A ^a   Villanger, Yngve ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Algorithms; Degenerate graphs; Domination; Parameterized complexity

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTERS; TECHNICAL PRESENTATIONS;

AVERAGE DEGREES; DEGENERATE GRAPHS; DOMINATING SETS; DOMINATION; GRAPH CLASSES; HARD PROBLEMS; OF GRAPHS; PARAMETERIZED COMPLEXITY; SPARSE GRAPHS;

GRAPH THEORY;

EID: 58349088411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92248-3_18     Document Type: Conference Paper

References (20)

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, 461-493 (2002)
2. Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 394-405. Springer, Heidelberg (2007)
3. Amini, O., Fomin, F.V., Saurabh, S.: Parameterized algorithms for partial cover problems (submitted, 2008)
4. Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms 15, 385-415 (1993)
5. Cai, L., Kloks, T.: Parameterized tractability of some (efficient) Y -domination variants for planar graphs and t-degenerate graphs. In: International Computer Symposium (ICS), Taiwan (2000)
6. Cesati, M.: Perfect code is W[1]-complete. Inform. Process. Lett. 81, 163-168 (2002)
7. Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: LICS, pp. 270-279. IEEE Computer Society, Los Alamitos (2007)
8. 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, 33-47 (2005)
9. 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, 866-893 (2005) (electronic)
10. Demaine, E.D., Hajiaghayil, M.T.: The bidimensionality theory and its algorithmic applications. The Computer Journal (2007)
11. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. I. Basic results. SIAM J. Comput., 24, 873-921 (1995)
12. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. II. On completeness for W[1]. Theoret. Comput. Sci. 141, 109-131 (1995)
13. Downey, R.G., Fellows, M.R.: Parameterized complexity, Monographs in Computer Science. Springer, New York (1999)
14. Flum, J., Grohe, M.: Parameterized complexity theory, Texts in Theoretical Computer Science. EATCS Series. Springer, Berlin (2006)
15. Gabow, H.N., Myers, E.W.: Finding all spanning trees of directed and undirected graphs. SIAM J. Comput. 7, 280-287 (1978)
16. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of vertex cover variants. Theory Comput. Syst. 41, 501-520 (2007)
17. Kneis, J., Mölle, D., Rossmanith, P.: Partial vs. complete domination: t-dominating set. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pla?il, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 367-376. Springer, Heidelberg (2007)
18. Kostochka, A.V.: The minimum Hadwiger number for graphs with a given mean degree of vertices, Metody Diskret., Analiz, pp. 37-58 (1982)
19. Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 95, 261-265 (1984)
20. Thomason, A.: The extremal function for complete minors. J. Combin. Theory Ser. B 81, 318-338 (2001)