New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
Computational Complexity
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Computing minimal models, stable models and answer sets
Theory and Practice of Logic Programming
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
New upper bound for the #3-SAT problem
Information Processing Letters
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
On Independent Sets and Bicliques in Graphs
Graph-Theoretic Concepts in Computer Science
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
A tighter bound for counting max-weight solutions to 2SAT instances
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact Exponential Algorithms
| Hi-index | 0.00 |
The main result of this paper is an algorithm counting maximal independent sets in graphs with maximum degree at most 3 in time O *(1.2570n ) and polynomial space.