61 search results - page 7 / 13 » siamdm 2010 |
SIAMDM
2010
14 years 7 months ago
2010
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
SIAMDM
2010
14 years 7 months ago
2010
We establish a stronger symmetry between the numbers of northeast and southeast chains in the context of 01-fillings of moon polyominoes. Let M be a moon polyomino with n rows and...
116
click to vote
SIAMDM
2010
14 years 10 months ago
2010
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
SIAMDM
2010
14 years 10 months ago
2010
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in Rn . We show that the minimum distance is multipli...
102
click to vote
SIAMDM
2010
14 years 7 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...