778 search results - page 63 / 156 » Bounding Smooth Integers |
WG
2001
Springer
14 years 3 days ago
2001
Springer
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
DM
2010
13 years 7 months ago
2010
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...
DISOPT
2008
13 years 7 months ago
2008
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
DM
2006
13 years 7 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...