Exact algorithms for exact satisfiability and number of perfect matchings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 548-559

  Björklund, Andreas ^a   Husfeldt, Thore ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

EXACT ALGORITHMS; EXACT SATISFIABILITY PROBLEM; INCLUSION-EXCLUSION CHARACTERISATIONS; N-ELEMENT SET COVER PROBLEMS;

PROBLEM SOLVING;

EID: 33746360269     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_48     Document Type: Conference Paper

References (25)

1. O. Angelsmark and J. Thapper. Partitioning based algorithms for some colouring problems. In Recent Advances in Constraints, volume 3978 of LNAI, pages 44-58. Springer Verlag, Berlin, 2005.
2. E. T. Bax. Inclusion and exclusion algorithm for the Hamiltonian Path problem. Inf. Process. Lett., 47(4):203-207, 1993.
3. A. Björklund and T. Husfeldt. Inclusion-exclusion based algorithms for graph colouring. Technical Report TR06-44, Elect. Coll. Comput. Compl., 2006.
4. J. M. Byskov. Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters, 32:547-556, 2004.
5. J. M. Byskov. Exact algorithms for graph colouring and exact satisfiability. PhD thesis, University of Aarhus, 2004.
6. S. Chien. A determinant-based algorithm for counting perfect matchings in a general graph. In Proc. 15th SODA, pages 728-735, 2004.
7. N. Christofides. An algorithm for the chromatic number of a graph. Computer J., 14:38-39, 1971.
8. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Comput., 9(3):251-280, 1990.
9. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394-397, 1962.
10. D. Eppstein. Small maximal independent sets and faster exact graph coloring. J. Graph Algorithms and Applications, 7(2):131-140, 2003.
11. T. Feder and R. Motwani. Worst-case time bounds for coloring and satisfiability problems. J. Algorithms, 45(2):192-201, 2002.
12. U. Feige and J. Kilian. Exponential time algorithms for computing the bandwidth of a graph. Manuscript, cited in [24].
13. Y. Gurevich and S. Shelah. Expected computation time for Hamiltonian path problem. SIAM Journal on Computing, 16(3):486-502, 1987.
14. M. Hujter and Z. Tuza. On the number of maximal independent sets in triangle-free graphs. SIAM J. Discrete Mathematics, 6(2):284-288, 1993.
15. M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. In Proc. 33rd STOC, pages 712-721, 2001.
16. E. L. Lawler. A note on the complexity of the chromatic number problem. Information Processing Letters, 5(3):66-67, 1976.
17. B. A. Madsen. An algorithm for exact satisfiability analysed with the number of clauses as parameter. Information Processing Letters, 97(1):28-30, 2006.
18. J. W. Moon and L. Moser. On cliques in graphs. Israel J. Math., 1965.
19. S. Forschen. On some weighted satisfiability and graph problems. In Proc. 31st SOFSEM, volume 3381 of LNCS, pages 278-287, 2005.
20. H. J. Ryser. Combinatorial Mathematics. Number 14 in Cams Math. Monographs. Math. Assoc. America, 1963.
21. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa. A new algorithm for generating all the maximal independent sets. SIAM J. Comput., 6(3):505-517, 1977.
22. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8; 189-201, 1979.
23. R. Williams. A. new algorithm for optimal constraint satisfaction and its implications. In Proc. 31st ICALP, pages 1227-1237, 2004.
24. G. J. Woeginger. Exact algorithms for NP-hard problems: a survey. In Combinatorial optimization: Eureka, you shrink!, pages 185-207. Springer, 2003.
25. G. J. Woeginger. Space and time complexity of exact algorithms: Some open problems. In Proc. 1st IWPEC, volume LNCS 3162, pages 281-290, 2004.