3 search results - page 1 / 1 » Eliminating Cycles in the Discrete Torus |
ALGORITHMICA
2008
13 years 5 months ago
2008
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
SIAMDM
2010
13 years 23 hour ago
2010
Let (Cd m) denote the graph whose set of vertices is Zd m in which two distinct vertices are adjacent iff in each coordinate either they are equal or they differ, modulo m, by at
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...