167 search results - page 10 / 34 » A class of polynomially solvable linear complementarity prob... |
113
click to vote
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
113
click to vote
DAM
2006
15 years 11 days ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
ECCC
2006
15 years 11 days ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
125
click to vote
EC
2008
14 years 12 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
FCT
2009
Springer
15 years 7 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 ...