Diskretn. Anal. Issled. Oper., 2013, Volume 20, Number 1

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

2013, Volume 20, Number 1

	Half-chromatic number of graph V. G. Vizing		3
	Some polynomially solvable cases and approximation algorithms for optimal communication tree construction problem A. I. Erzin, R. V. Plotnikov, Yu. V. Shamardin		12
	Perfect $3$-colorings of prisms and Möbius ladders M. A. Lisitsyna		28
	A new attainable lower bound on the number of nodes in quadruple circulant networks E. A. Monakhova		37
	On optimal cycles for regular balanced no-wait robotic cell problems S. V. Pavlov		45
	Majorants and minorants in the graph class with given number of vertices and diameter T. I. Fedoryaeva		58
	Essential dependence of the Kasami bent functions on the products of variables A. A. Frolova		77
	The smallest $k$-enclosing ball problem V. V. Shenmaier		93