Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
暂无分享,去创建一个
[1] Alex D. Scott,et al. Linear-programming design and analysis of fast algorithms for Max 2-CSP , 2006, Discret. Optim..
[2] Patrick Traxler. The Time Complexity of Constraint Satisfaction , 2008, IWPEC.
[3] Fedor V. Fomin,et al. Reports in Informatics , 2005 .
[4] Burkhard Monien,et al. Upper bounds on the bisection width of 3- and 4-regular graphs , 2006, J. Discrete Algorithms.
[5] Mikko Koivisto,et al. An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[6] Andreas Björklund,et al. Set Partitioning via Inclusion-Exclusion , 2009, SIAM J. Comput..
[7] Alex D. Scott,et al. Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time , 2006, Combinatorics, Probability and Computing.
[8] Andreas Björklund,et al. Fourier meets möbius: fast subset convolution , 2006, STOC '07.
[9] Fabrizio Grandoni,et al. Measure and conquer: a simple O(20.288n) independent set algorithm , 2006, SODA '06.
[10] Andreas Björklund,et al. Inclusion--Exclusion Algorithms for Counting Set Partitions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[11] Andrei A. Bulatov,et al. The complexity of partition functions , 2005, Theor. Comput. Sci..
[12] Jaroslav Nesetril,et al. Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.
[13] Mikko Koivisto,et al. Optimal 2-constraint satisfaction via sum-product algorithms , 2006, Inf. Process. Lett..
[14] Martin Fürer,et al. Algorithms for Counting 2-SAT Solutions and Colorings with Applications , 2005, Electron. Colloquium Comput. Complex..
[15] Hans L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.
[16] Ryan Williams,et al. A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..
[17] Peter L. Hammer,et al. Discrete Applied Mathematics , 1993 .
[18] Andreas Björklund,et al. Computing the Tutte Polynomial in Vertex-Exponential Time , 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[19] Ryan Williams. A new algorithm for optimal constraint satisfaction and its implications , 2004, Electron. Colloquium Comput. Complex..
[20] Béla Bollobás,et al. Exact Bounds for Judicious Partitions of Graphs , 1999, Comb..
[21] Stefan Richter,et al. A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms , 2008, SIAM J. Discret. Math..
[22] Rina Dechter,et al. Tree Clustering for Constraint Networks , 1989, Artif. Intell..
[23] DechterRina,et al. Tree clustering for constraint networks (research note) , 1989 .
[24] Bruce A. Reed,et al. Finding approximate separators and computing tree width quickly , 1992, STOC '92.
[25] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[26] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..
[27] D ScottAlexander,et al. Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function , 2009 .
[28] Rina Dechter,et al. Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..
[29] Martin E. Dyer,et al. On Counting Homomorphisms to Directed Acyclic Graphs , 2006, ICALP.
[30] Burkhard Monien,et al. Upper bounds on the bisection width of 3- and 4-regular graphs , 2001, J. Discrete Algorithms.
[31] Magnus Wahlström,et al. Counting models for 2SAT and 3SAT formulae , 2005, Theor. Comput. Sci..
[32] Martin E. Dyer,et al. On counting homomorphisms to directed acyclic graphs , 2006, JACM.
[33] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[34] Vangelis Th. Paschos,et al. An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs , 2008, IWPEC.
[35] Klaus Jansen,et al. Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs , 2005, SIAM J. Comput..
[36] Andreas Björklund,et al. Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings , 2006, ICALP.
[37] Gregory B. Sorkin,et al. Generalized Constraint Satisfaction Problems , 2006 .
[38] Ryan Williams,et al. Finding paths of length k in O*(2k) time , 2008, Inf. Process. Lett..
[39] Alex D. Scott,et al. Judicious partitions and related problems , 2005, BCC.
[40] Klaus Jansen,et al. Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs , 2001, SIAM J. Comput..