An algorithm for counting maximum weighted independent sets and its applications

@inproceedings{Dahllf2002AnAF,
  title={An algorithm for counting maximum weighted independent sets and its applications},
  author={Vilhelm Dahll{\"o}f and Peter Jonsson},
  booktitle={SODA},
  year={2002}
}
We present an O(1.3247n) algorithm for counting the number of independent sets with maximum weight in graphs. We show how this algorithm can be used solving a number of different counting problems: counting exact covers, exact hitting sets, weighted set packing and satisfying assignments in 1-in-k SAT. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…