2430 search results - page 134 / 486 » Computing Tutte Polynomials |
148
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
DAGSTUHL
2006
15 years 6 months ago
2006
Abstract. We propose a new algorithm for the computation of the minimal associated primes of an ideal. In [1] we have introduced modifications to an algorithm for the computation o...
162
click to vote
TCS
2011
14 years 11 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
123
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
132
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...