Branch and Recharge: Exact Algorithms for Generalized Domination
- 1 January 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 507-518
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach2005
- Enumerating maximal independent sets with applications to graph colouringOperations Research Letters, 2004
- Algorithms for four variants of the exact satisfiability problemTheoretical Computer Science, 2004
- On the number of maximal bipartite subgraphs of a graphJournal of Graph Theory, 2004
- Exact Algorithms for NP-Hard Problems: A Survey2003
- Small Maximal Independent Sets and Faster Exact Graph ColoringJournal of Graph Algorithms and Applications, 2003
- Independent sets with domination constraintsDiscrete Applied Mathematics, 2000
- Paired-domination in graphsNetworks, 1998
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete ProblemsSIAM Journal on Computing, 1981
- On cliques in graphsIsrael Journal of Mathematics, 1965