2430 search results - page 264 / 486 » Computing Tutte Polynomials |
141
Voted
DCC
2002
IEEE
16 years 3 months ago
2002
IEEE
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
122
click to vote
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
144
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
We consider Fisher and Arrow-Debreu markets under additively-separable, piecewise-linear, concave utility functions, and obtain the following results: ? For both market models, if...
124
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
123
click to vote
FLOPS
2010
Springer
15 years 11 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...