1998 search results - page 84 / 400 » Complexity of the Cover Polynomial |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
IAJIT
2010
13 years 8 months ago
2010
: Power amplifiers are essential components in communication systems and are inherently nonlinear. The nonlinearity creates spectral growth beyond the signal bandwidth, which inter...
NETWORKS
2010
13 years 8 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
STACS
2010
Springer
14 years 1 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
ENDM
2006
13 years 10 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...