Branch and recharge: Exact algorithms for generalized domination

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

Volumn 4619 LNCS, Issue , 2007, Pages 507-518

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

^a UNIVERSITY OF BERGEN   (Norway)

^b CHARLES UNIVERSITY   (Czech Republic)

^c UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; INTEGER PROGRAMMING; POLYNOMIALS; SET THEORY;

POLYNOMIAL SPACE; VERTEX SUBSET;

ALGORITHMS;

EID: 38149064593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73951-7_44     Document Type: Conference Paper

References (16)

1. Björklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions. In: Proceedings of FOCS, pp. 575-582 (2006)
2. Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters 32, 547-556 (2004)
3. Byskov, J.M., Madsen, B.A., Skjernaa, B.: On the number of maximal bipartite subgraphs of a graph. Journal of Graph Theory 48, 127-132 (2005)
4. Dahlöf, V., Jonsson, P., Beigel, R.: Algorithms for four variants of the exact satisfiability problem. Theoretical Computer Science 320, 373-394 (2004)
5. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1999)
6. Eppstein, D.: Small maximal independent sets and faster exact graph coloring. Journal of Graph Algorithms and Applications 7, 131-140 (2003)
7. n). In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 184-191. Springer, Heidelberg (2006)
8. Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Bounding the Number of Minimal Dominating Sets: a Measure and Conquer Approach. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 573-582. Springer, Heidelberg (2005)
9. Gupta, S., Raman, V., Saurabh, S.: Fast exponential algorithms for Maximum r-regular induced subgraph problems. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 139-151. Springer, Heidelberg (2006)
10. Halldorsson, M.M., Kratochvil, J., Telle, J.A.: Independent sets with domination constraints. Discrete Applied Mathematics 99, 39-54 (2000)
11. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
12. Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic Journal of Computing 5, 128-142 (1998)
13. Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 5, 23-28 (1965)
14. n/d) algorithm for certain NP-complete problems. SIAM Journal on Computing 3, 456-464 (1981)
15. Telle, J.A.: Complexity of domination-type problems in graphs. Nordic Journal of Computing 1, 157-171 (1994)
16. Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185-207. Springer, Heidelberg (2003)