Counting independent sets in claw-free graphs

Authors:
Konstanty Junosza-Szaniawski;Zbigniew Lonc;Micha$#322/ Tuczy$#324/ski
Affiliations:
Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland;Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland;Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland
Venue:
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Year:
2011

Citing 8
Cited 0

New methods for 3-SAT decision and worst-case analysis

Theoretical Computer Science
The Complexity of Counting in Sparse, Regular, and Planar Graphs

SIAM Journal on Computing
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
Set Partitioning via Inclusion-Exclusion

SIAM Journal on Computing
A tighter bound for counting max-weight solutions to 2SAT instances

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Measure and conquer: domination – a case study

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give an algorithm for counting the number of all independent sets in a claw-free graph which works in time O*(1.08352n) for graphs with no vertices of degree larger than 3 and O*(1.23544n) for arbitrary claw-free graphs, where n is the number of vertices in the instance graph.