224 search results - page 11 / 45 » G-graphs for the cage problem: a new upper bound |
141
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
171
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
151
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
164
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
141
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...