Branch and recharge: Exact algorithms for generalized domination

Algorithmica (New York)

Volumn 61, Issue 2, 2011, Pages 252-273

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

^a UNIVERSITY OF BERGEN   (Norway)

^b DURHAM UNIVERSITY   (United Kingdom)

^c CHARLES UNIVERSITY   (Czech Republic)

^d UNIVERSITÉ DE LORRAINE   (France)

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

Author keywords

Branch and recharge; Exact exponential algorithms; Generalized domination; NP hard problems

Indexed keywords

BRANCH AND RECHARGE; CONSECUTIVE INTEGERS; DESIGN AND ANALYSIS; DOMINATING SETS; DOMINATION PROBLEM; EXACT ALGORITHMS; EXPONENTIAL ALGORITHMS; GENERALIZED DOMINATION; GRAPH INVARIANT; INPUT GRAPHS; N-VERTEX GRAPH; NON-EMPTY SETS; NON-TRIVIAL; NONNEGATIVE INTEGERS; NP-HARD PROBLEM; UNDIRECTED GRAPH; UPPER BOUND;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGER PROGRAMMING;

ALGORITHMS;

EID: 80051546478     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-010-9418-9     Document Type: Article

References (25)

1. n ) J. Algorithms 54 168 204 2111907 1101.68716 10.1016/j.jalgor.2004.06.008 (Pubitemid 40122342)
2. Björklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions. In: Proceedings of FOCS 2006, pp. 575-582. IEEE Press, New York (2006)
3. J.M. Byskov 2004 Enumerating maximal independent sets with applications to graph colouring Oper. Res. Lett. 32 547 556 2077457 1052.05055 10.1016/j.orl.2004.03.002
4. J.M. Byskov B.A. Madsen B. Skjernaa 2005 On the number of maximal bipartite subgraphs of a graph J. Graph Theory 48 127 132 2110582 1059.05045 10.1002/jgt.20041 (Pubitemid 40212586)
5. D. Eppstein 2003 Small maximal independent sets and faster exact graph coloring J. Graph Algorithm Appl. 7 131 140 2112051 1027.05092 (Pubitemid 39064690)
6. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: domination-a case study. In: Proceedings of ICALP 2005. LNCS, vol. 3380, pp. 192-203. Springer, Berlin (2005)
7. Fomin, F.V., Golovach, P., Kratsch, D., Kratochvil, J., Liedloff, M.: Branch and recharge: exact algorithms for generalized domination. In: Proceedings of WADS 2007. LNCS, vol. 4619, pp. 508-519. Springer, Berlin (2007)
8. F.V. Fomin S. Gaspers A.V. Pyatkin I. Razgon 2008 On the minimum feedback vertex set problem: exact and enumeration algorithms Algorithmica 52 293 307 2434969 1170.68029 10.1007/s00453-007-9152-0
9. F.V. Fomin F. Grandoni A.V. Pyatkin A.A. Stepanov 2008 Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications ACM Trans. Algorithms 5 1 9 2479180 10.1145/1435375.1435384
10. F.V. Fomin P.A. Golovach J. Kratochvil D. Kratsch M. Liedloff 2009 Sort and search: exact algorithms for generalized domination Inf. Process. Lett. 109 795 798 2530632 1197.05104 10.1016/j.ipl.2009.03.023
11. F.V. Fomin F. Grandoni D. Kratsch 2009 A measure & conquer approach for the analysis of exact algorithms J. ACM 56 5 25 2590817 10.1145/1552285. 1552286
12. 0.288n ) independent set algorithm. In: Proceedings of SODA 2006, pp. 18-25. SIAM, Philadelphia (2006) (Pubitemid 43275220)
13. Golovach, P., Kratochvíl, J.: Computational complexity of generalized domination: a complete dichotomy for chordal graphs. In: Proceedings of WG 2007. LNCS, vol. 4769, pp. 1-11. Springer, Berlin (2007) (Pubitemid 351152817)
14. Golovach, P., Kratochvíl, J.: Generalized domination in degenerate graphs: a complete dichotomy of computational complexity. In: Proceedings of TAMC 2008. LNCS, vol. 4978, pp. 182-191. Springer, Berlin (2008)
15. Golovach, P., Kratochvíl, J., Suchý, O.: Parameterized complexity of generalized domination problems. In: Proceedings of WG 2009. LNCS, vol. 5911, pp. 133-142. Springer, Berlin (2009)
16. Gupta, S., Raman, V., Saurabh, S.: Fast exponential algorithms for Maximum r-regular induced subgraph problems. In: Proceedings of FSTTCS 2006. LNCS, vol. 4337, pp. 139-151. Springer, Berlin (2006)
17. M.M. Halldorsson J. Kratochvíl J.A. Telle 2000 Independent sets with domination constraints Discrete Appl. Math. 99 39 54 1743823 0939.05063 10.1016/S0166-218X(99)00124-9
18. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Dekker, New York (1998)
19. P. Heggernes J.A. Telle 1998 Partitioning graphs into generalized dominating sets Nord. J. Comput. 5 128 142 1638697 0905.68100
20. O. Kullmann 1999 New methods for 3-SAT decision and worst-case analysis Theor. Comput. Sci. 223 1 72 1704636 0930.68066 10.1016/S0304-3975(98)00017-6 (Pubitemid 129609093)
21. E.L. Lawler 1976 A note on the complexity of the chromatic number problem Inf. Process. Lett. 5 66 67 464675 0336.68021 10.1016/0020-0190(76)90065-X
22. J.W. Moon L. Moser 1965 On cliques in graphs Isr. J. Math. 5 23 28 182577 10.1007/BF02760024
23. Rosen, K.H.: Discrete Mathematics and Its Applications. McGraw-Hill, New York (2007)
24. J.A. Telle 1994 Complexity of domination-type problems in graphs Nord. J. Comput. 1 157 171 1330148
25. Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: Combinatorial Optimization-Eureka, You Shrink! LNCS, vol. 2570, pp. 185-207. Springer, Berlin (2003) (Pubitemid 137631161)