Sciweavers

Share
96 search results - page 1 / 20
» Improved Exact Algorithms for Counting 3- and 4-Colorings
Sort
View
COCOON
2007
Springer
10 years 3 months ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh
SAT
2005
Springer
162views Hardware» more  SAT 2005»
10 years 5 months ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz
CORR
2010
Springer
92views Education» more  CORR 2010»
9 years 11 months ago
Exact counting of Euler Tours for generalized series-parallel graphs
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
Prasad Chebolu, Mary Cryan, Russell A. Martin
SOFSEM
2007
Springer
10 years 5 months ago
Exact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
Martin Fürer, Shiva Prasad Kasiviswanathan
ICTCS
2005
Springer
10 years 5 months ago
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
Venkatesh Raman, Saket Saurabh, Somnath Sikdar
books