Algorithms for Counting 2-Sat Solutions and Colorings with Applications

  • Martin Fürer
  • Shiva Prasad Kasiviswanathan
Conference paper

DOI: 10.1007/978-3-540-72870-2_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4508)
Cite this paper as:
Fürer M., Kasiviswanathan S.P. (2007) Algorithms for Counting 2-Sat Solutions and Colorings with Applications. In: Kao MY., Li XY. (eds) Algorithmic Aspects in Information and Management. AAIM 2007. Lecture Notes in Computer Science, vol 4508. Springer, Berlin, Heidelberg

Abstract

An algorithm is presented for exactly counting the number of maximum weight satisfying assignments of a 2-Cnf formula. The worst case running time of O( 1.246n) for formulas with n variables improves on the previous bound of O( 1.256n) by Dahllöf, Jonsson, and Wahlström. The algorithm uses only polynomial space. As a direct consequence we get an O(1.246n) time algorithm for counting maximum weighted independent sets in a graph.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Martin Fürer
    • 1
  • Shiva Prasad Kasiviswanathan
    • 1
  1. 1.Computer Science and Engineering, Pennsylvania State University 

Personalised recommendations