2976 search results - page 337 / 596 » On the bounded integer programming |
134
Voted
DM
2007
15 years 4 months ago
2007
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
157
click to vote
COMBINATORICS
1998
15 years 4 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
152
click to vote
JCT
2010
15 years 3 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
121
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
227
Voted
POPL
2003
ACM
16 years 5 months ago
2003
ACM
Now that the use of garbage collection in languages like Java is becoming widely accepted due to the safety and software engineering benefits it provides, there is significant int...