2430 search results - page 333 / 486 » Computing Tutte Polynomials |
144
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
127
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper extends a method for integrating source-code model checking with dynamic system analysis to verify properties of controllers for nonlinear dynamic systems. Source-co...
123
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
104
Voted
ARITH
2007
IEEE
15 years 10 months ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
AAECC
2007
Springer
15 years 9 months ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...