Computing the domination number of grid graphs.
Alanko, Samu, Crevals, Simon, Isopoussu, Anton, Östergård, Patric, Pettersson, Ville (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Maximally Balanced Connected Partition Problem in Graphs: Application in Education”
Computing the domination number of grid graphs.
The sum-product algorithm: algebraic independence and computational aspects
Francesco M. Malvestuto (2013)
Kybernetika
Similarity:
The sum-product algorithm is a well-known procedure for marginalizing an “acyclic” product function whose range is the ground set of a commutative semiring. The algorithm is general enough to include as special cases several classical algorithms developed in information theory and probability theory. We present four results. First, using the sum-product algorithm we show that the variable sets involved in an acyclic factorization satisfy a relation that is a natural generalization of...
On graphs whose reduced energy does not exceed 3.
Lazić, Mirjana (2005)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Path partitions of planar graphs.
Glebov, A.N., Zambalaeva, D.Zh. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals.
Bernardi, Olivier (2007)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On first experiences with the implementation of a Newton based linear programming approach.
Wanka, A. (1989)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On the Hopfield algorithm. Foundations and examples.
Popoviciu, Nicolae, Boncuţ, Mioara (2005)
General Mathematics
Similarity:
Chromatically unique bipartite graphs with certain 3-independent partition numbers. II.
Hasni, Roslan, Peng, Y.H. (2006)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Algorithm for turnpike policies in the dynamic lot size model
Stanisław Bylka (1996)
Applicationes Mathematicae
Similarity:
This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted...