Branch and Recharge: Exact Algorithms for Generalized Domination
- 4 June 2010
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 61 (2) , 252-273
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A measure & conquer approach for the analysis of exact algorithmsJournal of the ACM, 2009
- Sort and Search: Exact algorithms for generalized dominationInformation Processing Letters, 2009
- Combinatorial bounds via measure and conquerACM Transactions on Algorithms, 2008
- On the Minimum Feedback Vertex Set Problem: Exact and Enumeration AlgorithmsAlgorithmica, 2007
- Branch and Recharge: Exact Algorithms for Generalized DominationLecture Notes in Computer Science, 2007
- Inclusion--Exclusion Algorithms for Counting Set Partitions2006
- 3-coloring in timeJournal of Algorithms, 2005
- Enumerating maximal independent sets with applications to graph colouringOperations Research Letters, 2004
- On the number of maximal bipartite subgraphs of a graphJournal of Graph Theory, 2004
- Small Maximal Independent Sets and Faster Exact Graph ColoringJournal of Graph Algorithms and Applications, 2003