1383 search results - page 59 / 277 » On the Complexity of the Interlace Polynomial |
126
click to vote
IAJIT
2010
15 years 4 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...
145
click to vote
NETWORKS
2010
15 years 4 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...
150
click to vote
STACS
2010
Springer
15 years 10 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...
161
click to vote
ENDM
2006
15 years 6 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...
181
click to vote
EOR
2011
14 years 9 months ago
2011
Due to its complexity, its challenging features, and its practical relevance, personnel scheduling has been heavily investigated in the last few decades. However, there is a relati...