1729 search results - page 261 / 346 » On Bounds for the k-Partitioning of Graphs |
SAT
2004
Springer
15 years 3 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
FSTTCS
2003
Springer
15 years 3 months ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...