Sort and Search: Exact algorithms for generalized domination

Information Processing Letters

Volumn 109, Issue 14, 2009, Pages 795-798

  Fomin, Fedor V ^a   Golovach, Petr A ^a   Kratochvíl, Jan ^b   Kratsch, Dieter ^c   Liedloff, Mathieu ^d  

^a UNIVERSITY OF BERGEN   (Norway)

^b CHARLES UNIVERSITY   (Czech Republic)

^c UNIVERSITÉ DE LORRAINE   (France)

^d UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Domination; Exact algorithms; Graph algorithms

Indexed keywords

DOMINATING SETS; DOMINATION; EXACT ALGORITHMS; GRAPH ALGORITHMS; GRAPH INVARIANTS; NON-NEGATIVE INTEGERS; UNDIRECTED GRAPHS;

ALGORITHMS;

GRAPH THEORY;

EID: 67349232371     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.03.023     Document Type: Article

References (11)

1. Dahlöf V., Jonsson P., and Beigel R. Algorithms for four variants of the exact satisfiability problem. Theoret. Comput. Sci. 320 (2004) 373-394
2. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer-Verlag, New York
3. Downey R.G., Fellows M.R., Vardi A., and Whitte G. The parameterized complexity of some fundamental problems in coding theory. SIAM J. Comput. 29 (1999) 545-570
4. Fomin F.V., Golovach P., Kratsch D., Kratochvíl J., and Liedloff M. Branch and recharge: Exact algorithms for generalized domination. Proceedings of WADS 2007. LNCS vol. 4619 (2007), Springer 508-519
5. Halldorsson M.M., Kratochvíl J., and Telle J.A. Mod-2 independence and domination in graphs. Internat. J. Found. Comput. Sci. 11 (2000) 355-363
6. Haynes T.W., Hedetniemi S.T., and Slater P.J. Fundamentals of Domination in Graphs (1998), Marcel Dekker, New York
7. Horowitz E., and Sahni S. Computing partitions with applications to the knapsack problem. J. ACM 21 (1974) 277-292
8. Knuth D.E. Sorting and Searching. The Art of Computer Programming. second edition vol. 3 (1997), Addison-Wesley
9. n / d) algorithm for certain NP-complete problems. SIAM J. Comput. 3 (1981) 456-464
10. Telle J.A. Complexity of domination-type problems in graphs. Nordic J. Comput. 1 (1994) 157-171
11. Woeginger G.J. Exact algorithms for NP-hard problems: A survey. Combinatorial Optimization - Eureka, You Shrink!. LNCS vol. 2570 (2003), Springer-Verlag, Berlin 185-207